Cooperative item collecting problems in directed bipartite structures-Reference-Cited by-同舟云学术

Cooperative item collecting problems in directed bipartite structures

Published:2017 Issue:2 Volume:11 Page:JAMDSM0025-JAMDSM0025
ISSN:1881-3054
Container-title:Journal of Advanced Mechanical Design, Systems, and Manufacturing
language:en
Short-container-title:JAMDSM

Author:

KARUNO Yoshiyuki¹,TANAKA Seiya²

Affiliation:

1. Faculty of Mechanical Engineering, Kyoto Institute of Technology

2. Graduate School of Science and Technology, Kyoto Institute of Technology

Publisher

Japan Society of Mechanical Engineers

Subject

Industrial and Manufacturing Engineering,Mechanical Engineering

Link

https://www.jstage.jst.go.jp/article/jamdsm/11/2/11_2017jamdsm0025/_pdf

Reference10 articles.

1. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, (1979), Freeman, San Francisco.

2. Ibaraki, T., Algorithms and Data Structures (in Japanese), (1989), Shoko-do, Tokyo.

3. Karuno, Y., Nagamochi, H., and Wang, X., Optimization problems and algorithms in double-layered food packing systems, Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol. 4, No. 3, (2010), pp. 605-615.

4. Pferschy, U. and Schauer, J., The knapsack problem with conflict graphs, Journal of Graph Algorithms and Applications, Vol. 13, No. 2, (2009), pp. 233-249.

5. Samphaiboon, N. and Yamada, T., Heuristic and exact algorithms for the precedence-constrained knapsack problem, Journal of Optimization Theory and Applications, Vol. 105, No. 3, (2000), pp. 659-676.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative improvement approaches for collecting weighted items in directed bipartite graphs;Journal of Advanced Mechanical Design, Systems, and Manufacturing;2018