Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

Abstract : In this paper we develop a branch-and-bound algorithm for solving a particular integer quadratic multi-knapsack problem. The problem we study is defined as the maximization of a concave separable quadratic objective function over a convex set of linear constraints and bounded integer variables. Our exact solution method is based on the computation of an upper bound and also includes pre-procedure techniques in order to reduce the problem size before starting the branch-and-bound process. We lead a numerical comparison between our method and three other existing algorithms. The approach we propose outperforms other procedures for large-scaled instances (up to 2000 variables and constraints).
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00178894
Contributor : Marie-Hélène Hugonnard-Roche <>
Submitted on : Friday, October 12, 2007 - 2:14:12 PM
Last modification on : Wednesday, September 23, 2020 - 4:28:31 AM
Long-term archiving on: : Sunday, April 11, 2010 - 10:53:45 PM

File

cahierLamsade260.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00178894, version 1

Citation

Dominique Quadri, E. Soutif, Pierre Tolla. Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. 2007. ⟨hal-00178894⟩

Share

Metrics

Record views

207

Files downloads

165