An efficient algorithm for the collapsing knapsack problem

Information Sciences

Volumn 176, Issue 12, 2006, Pages 1739-1751

  Wu, Jigang ^a   Srikanthan, Thambipillai ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

0 1 knapsack problem; Collapsing knapsack problem; Exact algorithm; Expanding core

Indexed keywords

ALGORITHMS; FUNCTIONS; INFORMATION SCIENCE; PROBLEM SOLVING;

0-1 KNAPSACK PROBLEM; COLLAPSING KNAPSACK PROBLEM (CKP); EXACT ALGORITHM; EXPANDING-CORE; EXPANDING-CORE TECHNIQUE;

NONLINEAR SYSTEMS;

EID: 33645887842     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.07.014     Document Type: Article

References (13)

1. Posner M.E., and Guignard M. The collapsing 0-1 knapsack problem. Mathematical Programming 15 (1978) 155-161
2. Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Operations Research 45 (1997) 758-767
3. Balas E., and Zemel E. An algorithm for large zero-one knapsack problems. Operations Research 28 (1980) 1130-1154
4. Fayard D., and Plateau G. An algorithm for the solution of the 0-1 knapsack problem. Computing 28 (1982) 269-287
5. Martello S., and Toth P. A new algorithm for the 0-1 knapsack problem. Management Science 34 (1988) 633-644
6. Pisinger D. An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research 87 (1995) 175-187
7. Martello S., Pisinger D., and Toth P. Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45 (1999) 414-424
8. Caprara A., Kellerer H., Pferschy U., and Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123 (2000) 333-345
9. Minoux M., and Gabrel V. A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Operations Research Letters 30 (2002) 252-264
10. Fayard D., and Plateau G. An exact algorithm for the 0-1 collapsing knapsack problem. Discrete Applied Mathematics 49 (1994) 175-187
11. Pferschy U., Pisinger D., and Woeginger G.J. Simple but efficient approaches for the collapsing knapsack problem. Discrete Applied Mathematics 77 (1997) 271-280
12. Hiroshi I., and Takeaki U. A short note on the reducibility of the collapsing knapsack problem. Journal of the Operations Research Society of Japan 45 (2002) 293-298
13. Hoare C.A.R. Quicksort. Computer Journal 5 (1962) 10-15