Abstract
In this paper, we propose a branch and bound algorithm to solve the multiple-choice multidimensional knapsack problem. The branch and bound tree is arranged based on the orderings in the core and navigated in a depth first manner, which while consuming low memory effectively causes the core to be expanded by need. We use Osorio’s mixed constraint and the linear programming solution of the surrogated problem for bounding tests. The computational results and comparison with the previous best exact algorithm shows that the algorithm has significant performance improvement over the previous algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shahadatullah-Khan, M.: Quality adaptation in a multisession multimedia system: Model, algorithms and architecture, Ph.D. dissertation, Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada (1998)
Parra-Hernandez, R., Dimopoulos, N.J.: A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem. IEEE Transactions on Systems, Man, and Cybernetics 35(5), 708–717 (2005)
Hifi, M., Michrafy, M., Sbihi, A.: A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi- Dimensional Knapsack Problem. Computational Optimization and Applications 33(2-3), 271–285 (2006)
Akbar, M.M., Manning, E.G., Shoja, G.C., Khan, S.: Heuristic Solutions for the Multiple-Choice Multi-Dimension Knapsack Problem. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS-ComputSci 2001. LNCS, vol. 2074, pp. 659–668. Springer, Heidelberg (2001)
Mostofa Akbar, M., et al.: Solving Multidimensional Multiple-choice Knapsack by constructing convex hull. Computers and Operations Research 33(5), 1259–1273 (2006)
Sbihi, A.: A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. Journal of Combinatorial Optimization 13(4), 337–351 (2007)
Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Operations Research 28, 1130–1154 (1980)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. J. Wiley, Chichester (1990)
Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Operations Research 45, 758–767 (1997)
Pisinger, D.: A minimal algorithm for the Multiple-choice Knapsack Problem. European Journal of Operational Research 83, 394–410 (1995)
Sinha, P., Zoltners, A.: The Multiple-Choice Knapsack Problem. Operations Research 27(3), 503–515 (1979)
Glover, F.: Surrogate Constraint Duality in Mathematical Programming. Operations Research 23(3), 434–445 (1975)
Freville, A., Plateau, G.: An Efficient Preprocessing Procedure for the Multidimensional 0-1 Knapsack Problem. Discrete Applied Mathematics 49, 189–212 (1994)
Osorio, M.A., Hernandez, E.G.: Cutting Analysis for MKP. In: Proceedings of the Fifth Mexican International Conference in Computer Science, pp. 298–303 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Razzazi, M.R., Ghasemi, T. (2008). An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-89985-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89984-6
Online ISBN: 978-3-540-89985-3
eBook Packages: Computer ScienceComputer Science (R0)