0-1 QUADRATIC KNAPSACK PROBLEMS: AN EXACT APPROACH BASED ON A t-LINEARIZATION * - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Optimization Année : 2012

0-1 QUADRATIC KNAPSACK PROBLEMS: AN EXACT APPROACH BASED ON A t-LINEARIZATION *

Résumé

This paper presents an exact solution method based on a new linearization scheme for the 0-1 quadratic knapsack problem, which consists of maximizing a quadratic pseudo-Boolean function with nonnegative coefficients subject to a linear capacity constraint. Contrasting with traditional linearization schemes, our approach adds only one extra variable. The suggested linearization framework provides a tight upper bound, which is used in a branch-and-bound scheme. This upper bound is numerically compared with that of [A. Billionnet, A. Faye, and E. Soutif, European J. Oper. Res., 112 (1999), pp. 664–672], and our branch-and-bound scheme with the exact algorithm of [W. D. Pisinger, A. B. Rasmussen, and R. Sandvik, INFORMS J. Comput., 19 (2007), pp. 280–290]. The experiments show that our upper bound is quite competitive (less than 1% from the optimum). In addition, the proposed branch-and-bound clearly outperforms the algorithm developed by Pisinger et al. for low density instances (25%) for all instances up to 400 variables.
Fichier non déposé

Dates et versions

hal-01320143 , version 1 (23-05-2016)

Identifiants

Citer

Diego Carlos Rodrigues, D Quadri, P Michelon, S Gueye. 0-1 QUADRATIC KNAPSACK PROBLEMS: AN EXACT APPROACH BASED ON A t-LINEARIZATION *. SIAM Journal on Optimization, 2012, 22 (4), pp.1449-1468. ⟨10.1137/110820762⟩. ⟨hal-01320143⟩

Collections

UNIV-AVIGNON LIA
85 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More