A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

Journal of Combinatorial Optimization

Volumn 13, Issue 4, 2007, Pages 337-351

  Sbihi, Abdelkader ^a  

^a LANCASTER UNIVERSITY MANAGEMENT SCHOOL   (United Kingdom)

Author keywords

Branch and bound; Combinatorial optimization; Knapsack; Sequential algorithm

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

MULTIPLE CHOICE MULTIDIMENSIONAL KNAPSACK PROBLEM (MMKP); SEQUENTIAL ALGORITHMS;

ALGORITHMS;

EID: 34047233713     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9035-3     Document Type: Article

References (23)

1. Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problem. Oper Res 28:1130-1154
2. Chen G, Khan S, Li KF, Manning E (1999) Building an adaptive multimedia system using the utility model. In: Proceedings of international workshop on parallel and distributed realtime systems, San Juan, Puerto Rico
3. Chu P, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heur 4:63-86
4. Dantzig GB (1957) Discrete variable extremum problems. Oper Res 5:266-277
5. Fayard D, Plateau G (1982) An algorithm for the solution of the 0-1 knapsack problem. Computing 28:269-287
6. Hifi M, Michrafy M, Sbihi A (2004) Heuristic algorithms for the multiple-choice multi-dimensional knapsack problem. J Operat Res Soc 55(12): 1323-1332
7. Hifi M, Michrafy M, Sbihi A (2005) A reactive local search-based algorithm for the multiple-choice multidimensional knapasck problem. Computational Optimization and Applications, in press
8. Khan S, Li KF, Manning EG, Akbar MDM (2002) Solving the knapsack problem for adaptive multi-media systems. Studia Informatica, an International Journal, Special Issue on Cutting, Packing and Knapsacking problems 2/1:154-174
9. Khan S (1998) Quality adaptation in a multi-session adaptive multimedia system: model and architecture. PhD Thesis, Department of Electronical and Computer Engineering, University of Victoria
10. Luss H (1992) Minmax resource allocation problems: optimization and parametric analysis. Europ J Oper Res 60:76-86
11. Martello S, Toth P (1988) A newal gorithm for the 0-1 knapsack problem. Manag Sci 34:633-644
12. Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0-1 knapsack problem. Manag Sci 45:414-424
13. Moser M, Jokanović DP, Shiratori N (1997) An algorithm for the multidimesional multiple-choice knapsack problem. IEECE Trans Fundament Electron 80(3):582-589
14. Nauss MR (1978) The 0-1 knapsack problem with multiple-choice constraints. Europ J Oper Res 2:125-131
15. Pang JS, Yu CS (1989) A min-max resource allocation problem with substitutions. Europ J Oper Res 41:218-223
16. Pisinger D (1997) A minimal algorithm for the 0-1 knapsack problem. Oper Res 45:758-767
17. Pisinger D (1995) A minimal algorithm for the multiple-choice knapsack problem. Europ J Oper Res 83:394-410
18. Shih W (1979) A branch and bound method for the multiconstraint zero-one knapsack problem. J Oper Res Soc 30:69-378
19. Sinha A, Zoltners AA (1979) The multiple-choice knapsack problem. Oper Res 27:503-515
20. Sbihi A (2003) Hybrid methods in combinatorial optimisation: exact algorithms and heuristics. PhD Thesis, Cermsem UMR-CNRS 8095 Laboratory. University of Paris 1 Panthéon-Sorbonne
21. Shmoys DB, Tardos E (1993) An approximation algorithm for the generalized assignment problem. Math Prog 62:461-474
22. Toyoda Y (1975) A simplified algorithm for obtaining approximate solution to zero-one programming problems. Manag Sci 21:1417-1427
23. Watson RK (2001) Packet networks and optimal admission and upgrade of service level agreements: applying the utility model. MSc Thesis, Department of Electronical and Computer Engineering, University of Victoria