Heuristic and exact algorithms for the precedence-constrained knapsack problem

Journal of Optimization Theory and Applications

Volumn 105, Issue 3, 2000, Pages 659-676

  Samphaiboon, N ^a   Yamada, T ^b  

^a Royal Thai Air Force   (Thailand)

^b NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

Combinatorial optimization; Dynamic programming; Knapsack problem; Precedence constraints

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; HEURISTIC ALGORITHMS;

ACYCLIC GRAPHS; DYNAMIC PROGRAMMING ALGORITHM; EXACT ALGORITHMS; HEURISTICS ALGORITHM; KNAPSACK PROBLEMS; KNAPSACKS; OPTIMALITY; PRECEDENCE CONSTRAINED KNAPSACK PROBLEMS; PRECEDENCE CONSTRAINTS; PRECEDENCE RELATIONS;

DYNAMIC PROGRAMMING;

EID: 0034342543     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1004649425222     Document Type: Article

References (18)

1. 1. BUSACKER, R. G., and SAARTY, T. L., Finite Graphs and Networks: An Introduction with Applications, McGraw-Hill, New York, NY, 1965.
2. 2. HARARY, F., Graph Theory, Addison-Wesley, Reading, Massachusetts, 1969.
3. 3. AHUJA, R. K., MAGNANTI, T. L., and ORLIN, J. B., Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1993.
4. 4. SEDGEWICK, R., Algorithms in C, 3rd Edition, Addison-Wesley, Reading, Massachusetts, 1998.
5. 5. NEMHAUSER, G. L., and WOLSEY, L. A., Integer and Combinatorial Optimization, John Wiley and Sons, New York, NY, 1988.
6. 6. GAREY, M. R., and JOHNSON, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman and Company, San Francisco, CaliFornia, 1979.
7. 7. CHVÁTAL, V., Linear Programming, Freeman and Company, San Francisco, California, 1983.
8. 8. SALKIN, S. M., The Knapsack Problem: A Survey, Naval Research Logistic Quarterly, Vol. 27, pp. 127-144, 1975.
9. 9. MARTELLO, S., and TOTH, P., Knapsack Problems: Algorithms and Computer Implementations, John Wiley and Sons, New York, NY, 1990.
10. 10. JOHNSON, D. S., and NIEMI, K. A., On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees, Mathematics of Operations Research, Vol. 8, pp. 1-14, 1983.
11. 11. SHAW, D. X., and CHO, G., The Critical Item, Upper Bounds, and a Branch-and-Bound Algorithm for the Tree Knapsack Problem, Networks, Vol. 28, pp. 205-216, 1998.
12. 12. CHO, G., and SHAW, D. X., A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem, INFORMS Journal on Computing, Vol. 9, pp. 431-438, 1997.
13. 13. HIRABAYASHI, R., SUZUKI, H., and TUCHIYA, N., Optimal Tool Module Design Problem for NC Machine Tools, Journal of the Operations Research Society of Japan, Vol. 27, pp. 205-229, 1983.
14. 14. MORIYAMA, H., HADA, T., and SUZUKI, H., A Partially-Ordered Knapsack Problem and Scheduling, Proceedings of the Production Scheduling Symposium '96, Japan Industrial Management Association, pp. 79-84, 1996 (in Japanese).
15. 15. BAASE, S., Computer Algorithms: Introduction to Design and Analysis, 2nd Edition, Addison-Wesley, Reading, Massachusetts, 1993.
16. 16. BELLMAN, R., Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.
17. 17. LARSON, R. E., and CASTI, J. L., Principles of Dynamic Programming: Control and Systems Theory, Vol. 7, Marcel Dekker, New York, NY, 1978.
18. 18. HOROWITZ, E., and SAHNI, S., Computing Partitions with Applications to the Knapsack Problem, Journal of the Association for Computing Machinery, Vol. 21, pp. 277-292, 1974.