A column generation method for the multiple-choice multi-dimensional knapsack problem

Computational Optimization and Applications

Volumn 46, Issue 1, 2010, Pages 51-73

  Cherfi, N ^a   Hifi, M ^b  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Branch and bound; Column generation; Heuristics; Knapsack; Optimization

Indexed keywords

BRANCH AND BOUNDS; COLUMN GENERATION; EFFECTIVE SOLUTION; EXACT SOLUTION; KNAPSACK OPTIMIZATION; LOCAL SEARCH; LOCAL SEARCH METAHEURISTICS; MULTIDIMENSIONAL KNAPSACK PROBLEMS; OPTIMALITY; PROBLEM INSTANCES; RUNTIMES; SEARCH PROCESS;

INTEGER PROGRAMMING;

EID: 77950519451     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-008-9184-7     Document Type: Article

References (16)

1. Akbar, M.M., Sadid, M.W.H., Rahman, M.S., Newton, M.A.H., Kaykobad, M.: A Parallel heuristic algorithm for multiple-choice multi-dimensional knapsack problem. Working paper, Department of CSE, BUET, Dhaka-1000, Bangladesh (2005)
2. E. Balas E. Zemel 1980 An algorithm for large zero-one knapsack problem Oper. Res. 28 1130 1154 0449.90064 10.1287/opre.28.5.1130 589676
3. Björklund, P., Värbrand, P., Yuan, D.: A column generation method for spatial TDMA scheduling in ad hoc networks. Working paper, Department of Science and Technology, Linköping Institute of Technology, Norrköping, Sweden. To appear in Ad Hoc Netw.
4. D. Fayard G. Plateau 1982 An algorithm for the solution of the 0-1 knapsack problem Computing 28 269 287 0468.90045 10.1007/BF02241754
5. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
6. P.C. Gilmore R.E. Gomory 1961 A linear programming approach to the cutting stock problem Oper. Res. 9 849 859 0096.35501 10.1287/opre.9.6.849 137589
7. P.C. Gilmore R.E. Gomory 1963 A linear programming approach to the cutting stock problem, part II Oper. Res. 14 94 120 10.1057/jors.1963.12 204149
8. M. Hifi M. Michrafy A. Sbihi 2006 A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem Comput. Optim. Appl. 33 271 285 1103.90086 10.1007/s10589-005-3057-0 2208820 (Pubitemid 44020396)
9. M. Hifi M. Michrafy A. Sbihi 2004 Heuristic algorithms for the multiple-choice multidimensional knapsack problem J. Oper. Res. Soc. 55 1323 1332 1088.90043 10.1057/palgrave.jors.2601796
10. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2005). ISBN 3-540-40286-1
11. Khan, S.: Quality adaptation in a multi-session adaptive multimedia system: model and architecture. Ph.D. thesis, Department of Electronics and Computer Engineering, University of Victoria (1998)
12. S. Khan K.F. Li E.G. Manning MD.M. Akbar 2002 Solving the knapsack problem for adaptive multimedia systems Int. J. Studia Inf. 2 154 174 Special Issue on Cutting, Packing and Knapsacking Problems
13. A. Mehrotra M.A. Trick 1996 A column generation approach for graph coloring INFORMS J. Comput. 8 344 354 0884.90144 10.1287/ijoc.8.4.344
14. M. Moser D.P. Jokanović N. Shiratori 1997 An algorithm for the multidimensional multiple-choice knapsack problem IEECE Trans. Fundam. Electron. 80 582 589 (Pubitemid 127756115)
15. Y. Toyoda 1975 A simplified algorithm for obtaining approximate solution to zero-one programming problems Manag. Sci. 21 1417 1427 0307.90056 10.1287/mnsc.21.12.1417 441358
16. Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)