Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Computers and Operations Research

Volumn 39, Issue 1, 2012, Pages 27-31

  Della Croce, F ^a   Grosso, A ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Core problem; Multi dimensional knapsack problem; Partial enumeration

Indexed keywords

CORE PROBLEMS; HEURISTIC PROCEDURES; LP RELAXATION; MULTI-DIMENSIONAL KNAPSACK PROBLEM; MULTIDIMENSIONAL KNAPSACK PROBLEMS; PARALLEL-COMPUTING ENVIRONMENT; PARTIAL ENUMERATION; RECENT STATE; REDUCED COST;

HEURISTIC METHODS; PARALLEL ARCHITECTURES;

INTEGER PROGRAMMING;

EID: 79957589320     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.03.013     Document Type: Article

References (17)

1. E. Balas, and E. Zemel An algorithm for large zero-one knapsack problems Operations Research 28 1980 1130 1154
2. S. Boussier, M. Vasquez, Y. Vimont, S. Hanafi, and P. Michelon A multi-level search strategy for the 0/1 multidimensional knapsack problem Discrete Applied Mathematics 158 2010 97 109
3. P.C. Chu, and J.E. Beasley A genetic algorithm for the multidimensional knapsack problem Journal of Heuristics 4 1998 63 86 (Pubitemid 128512788)
4. N.J. Driebeek An algorithm for the solution of mixed integer programming problems Management Science 12 1966 576 587
5. E. Danna, E. Rothberh, and C. Le Pape Exploring relaxation induced neighborhood to improve MIP solutions Mathematical Programming 102 2005 71 90 (Pubitemid 40134692)
6. M. Fischetti, and A. Lodi Local branching Mathematical Programming 98 2003 23 47
7. A. Fréville The multidimensional 01 knapsack problem: an overview European Journal of Operational Research 155 2004 1 21
8. A. Fréville, and S. Hanafi The multidimensional 01 knapsack problem - bounds and computational aspects Annals of Operations Research 139 2004 195 227
9. Hanafi S, Wilbaut C. Improved convergent heuristics for the 01 multi-dimensional knapsack problem. Annals of Operations Research, Annals of Operations Research, 2011;183:125142(18), doi: 10.1007/s10479-009-0546-z.
10. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack problems 2004 Springer Berlin
11. J.T. Linderoth, P. Savelsbergh, and D.G. Luenberger A computational study of search strategies for mixed integer programming INFORMS Journal on Computing 11 1999 173 187
12. J. Lorie, and L.J. Savage Three problems in capital rationing Journal of Business 28 1955 229 239
13. Puchinger J, Raidl GR, Pferschy U. The multidimensional knapsack problem: structure and algorithms. INFORMS Journal on Computing 2010;22:25065.
14. A.L. Soyster, B. Lev, and W. Slivka Zero-one programming with many variables and few constraints European Journal of Operational Research 2 1978 195 201 (Pubitemid 8619224)
15. M. Vasquez, and Y. Vimont Improved results on the 01 multidimensional knapsack problem European Journal of Operational Research 165 2005 70 81 (Pubitemid 40135594)
16. Y. Vimont, S. Boussier, and M. Vasquez Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem Journal of Combinatorial Optimization 15 2008 165 178
17. C. Wilbaut, and S. Hanafi New convergent heuristics for 01 mixed integer programming European Journal of Operational Research 195 2009 62 74