Abstract
The separable quadratic multi-knapsack problem (QMKP) consists in maximizing a concave separable quadratic integer (non pure binary) function subject to m linear capacity constraints. In this paper we develop a branch-and-bound algorithm to solve (QMKP) to optimality. This method is based on the computation of a tight upper bound for (QMKP) which is derived from a linearization and a surrogate relaxation. Our branch-and-bound also incorporates pre-processing procedures. The computational performance of our branch-and-bound is compared to that of three exact methods: a branch-and-bound algorithm developed by Djerdjour et al. (1988), a 0-1 linearization method originally applied to the separable quadratic knapsack problem with a single constraint that we extend to the case of m constraints, a standard branch-and-bound algorithm (Cplex9.0 quadratic optimization). Our branch-and-bound clearly outperforms other methods for large instances (up to 2000 variables and constraints).
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
Billionnet, A., Faye, A., Soutif, E.: A New Upper Bound for the 0-1 Quadratic Knapsack Problem. European Journal of Operational Research 112(3), 664–672 (1999)
Bretthauer, K., Shetty, B.: The Nonlinear Knpasack Problem – Algorithms and Applications. European Journal of Operational Research 138(3), 459–472 (2002)
Bretthauer, K., Shetty, B.: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems. ORSA Journal on Computing 7(1), 109–116 (1995)
Cooper, M.: A Survey of Methods for Pure Nonlinear Integer Programming. Management Science 27(3), 351–353 (1981)
Djerdjour, M., Mathur, K., Salkin, H.: A Surrogate-Based Algorithm for the General Quadratic Multidimensional Knapsack. Operations Research Letters 7(5), 253–257 (1988)
Faaland, B.: An Integer Programming Algorithm for Portfolio Selection. Managment Science. 20(10), 1376–1384 (1974)
Glover, F.: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems. Managment Science 22(4), 455–460 (1975)
Hammer, P.L., Padberg, M.W., Peled, U.N.: Constraint Pairing in Integer Programming. INFOR 13(1), 68–81 (1975)
Korner, F.: Integer Quadratic Programming. European Journal of Operational Research 19(2), 268–273 (1985)
Korner, F.: On the Numerical Realization of the Exact Penalty Method for Quadratic Programming Algorithms. European Journal of Operational Research 46(3), 404–408 (1990)
Lueker, G.S.: Two NP-Complete Problems in Nonnegative Integer Programming. Computer Science Labatory, Princenton, NJ report 178 (A6) (1975)
Martello, S., Toth, P.: An Exact Algorithm for Two-Constraint 0-1 Knapsack Problem. Operations Research 51(5), 826–835 (2003)
Mathur, K., Salkin, H.: A Branch and Bound Algorithm for a Class of Nonlinear Knapsack Problems. Operations Research Letters. 2(4), 155–160 (1983)
Pisinger, D., Rasmussen, A., Sandvick, R.: Solution of Large Quadratic Knapsack Problems Through Agressive Reduction. INFORMS Journal on Computing, to appear (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Quadri, D., Soutif, E., Tolla, P. (2007). A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)