Greedy algorithm for the general multidimensional knapsack problem

Annals of Operations Research

Volumn 150, Issue 1, 2007, Pages 17-29

  Akçay, Yalçin ^a   Li, Haijun ^b   Xu, Susan H ^c  

^a KOÇ UNIVERSITY   (Turkey)

^b WASHINGTON STATE UNIVERSITY   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Heuristics; Integer programming; Multidimensional knapsack problems

Indexed keywords

EID: 33846894350     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0150-4     Document Type: Article

References (23)

1. Akcay, Y. and S.H. Xu. (2004). "Joint Inventory Replenishment and Component Allocation Optimization in An Assemble-to-Order System." Management Science, 50(1), 99-116.
2. Caprara, A., H. Kellerer, U. Pt'erschy, and D. Pisinger. (2000). "Approximation Algorithms for Knapsack Problems with Cardinality Constraints." European Journal of Operational Research, 123, 333-345.
3. Chu, P.C. and J.E. Beasley. (1998). "A Genetic Algorithm for the Multidimensional Knapsack Problem." Journal of Heuristics, 4, 63-86.
4. de Vries, S. and R. V. Vohra. (2003). "Combinatorial Auctions: A Survey." INFORMS Journal on Computing, 15, 284-310.
5. Everett, H. (1963). "Generalized Langrange Multiplier Method for Solving Problems of Optimum Allocation of Resources." Operations Research, 2, 399-417.
6. Freville, A. (2004). "The Multidimensional 0-1 Knapsack Problem: An Overview." European Journal of Operational Research, 155, 1-21.
7. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman.
8. Kellerer, H., U. Pferschy, and D. Pisinger. (2004). Knapsack Problems. Springer.
9. Kleywegt, A. and J.D. Papastavrou. (2001). "The dynamic and Stochastic Knapsack Problem with Random Sized Items." Operations Research, 49, 26-41.
10. Kochenberger, G.A., B.A. McCarl, and F.P. Wyman. (1974). "A Heuristic for General Integer Programming." Decision Sciences, 5, 36-44.
11. Lin, E.Y.-H. (1998). "A Bibliographical Survey on Some Well-Known Non-Standard Knapsack Problems." INFOR, 36(4), 274-317.
12. Loulou, R. and E. Michaelides. (1979). "New Greedy-like Heuristics for the Multidimensional 0-1 Knapsack Problem." Operations Research, 27, 1101-1114.
13. Lu, L.L., S.Y. Chiu, and L.A. Cox. (1999). "Optimal Project Selection: Stochastic Knapsack with Finite Time Horizon." Operations Research, 50, 645-450.
14. Magazine, M.J. and O. Oguz. (1984). "A Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem." European Journal of Operational Research, 16, 319-326.
15. Petersen, C.C. (1967). "Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects." Management Science, 13, 736-750.
16. Pirkul, H. (1987). "A Heuristic Solution Procedure for the Multiconstraint Zero-One Knapsack Problem." Naval Research Logistics, 34, 161-172.
17. Pirkul, H. and S. Narasimhan. (1986). "Efficient Algorithms for the Multiconstraint General Knapsack Problem." IIE Transactions, pp. 195-203.
18. Senju, S. and Y. Toyoda. (1968). "An Approach to Linear Programming with 0-1 Variables." Management Science, 15(4), B196-B207.
19. Shih, W. (1979). "A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem." Journal of Operational Research Society, 30, 369-378.
20. Toyoda, Y. (1975). "A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems." Management Science, 21(12), 1417-1427.
21. Volgenant, A. and J.A. Zoon. (1990). "An Improved Heuristic for Multidimensional 0-1 Knapsack Problems." Journal of Operational Research Society, 41, 963-970.
22. Weingartner, H.M. and D.N. Ness. (1967). "Methods for the Solution of the Multi-Dimensional 0/1 Knapsack Problem." Operations Research, 15, 83-103.
23. Zanakis, S.H. (1977). "Heuristic 0-1 Linear Programming: Comparisons of Three Methods." Management Science, 24, 91-103.