An exact method based on lagrangian decomposition for the 0-1 quadratic knapsack problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2004

An exact method based on lagrangian decomposition for the 0-1 quadratic knapsack problem

Résumé

The 0-1 quadratic knapsack problem (QKP) consists of maximizing a pseudo-Boolean quadratic function with positive coefficients subject to a linear capacity constraint. We present in this paper a new exact method for solving this problem. This method makes use of the computation of an upper bound for (QKP) using a technique derived from the Lagrangean decomposition methods. The method we use is applied to very large sized problems and allows to find the optimum of problems up to 150 variables whatever their density is and up to 300 variables for problems with medium and low density. KEY-WORDS: 0-1 quadratic optimization, knapsack, Lagrangean decomposition, computational results, branch and bound.
Fichier non déposé

Dates et versions

hal-01124918 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01124918 , version 1

Citer

Alain Billionnet, Eric Soutif. An exact method based on lagrangian decomposition for the 0-1 quadratic knapsack problem. European Journal of Operational Research, 2004, 157, pp.565-575. ⟨hal-01124918⟩

Collections

CNAM CEDRIC-CNAM
90 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More