Hybrid approaches for the two-scenario max-min knapsack problem - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Article Dans Une Revue International Transactions in Operational Research Année : 2012

Hybrid approaches for the two-scenario max-min knapsack problem

Résumé

In this paper, we deal with the two-scenario max-min knapsack (MNK) problem. First, we consider several formulations of MNK as a mixed integer programming problem. Then, we propose a hybrid method as an alternative to solve the MNK exactly. The approach combines relaxation technique and the temporary setting of variables to improve iteratively two sequences of upper and lower bounds. More precisely, pseudocuts are added to the problem to strengthen the bounds and reduce the gap between the best lower bound and the best upper bound. The algorithm stops when the proof of the optimality of the best solution is found. We also use a reduction technique to set some variables definitively at their optimal values. Numerical experiments demonstrate the robustness of the approach. In particular, our algorithm is efficient to solve large and correlated instances of MNK.
Fichier principal
Vignette du fichier
Hanafi et al. - 2012 - Hybrid approaches for the two‐scenario max–min knapsack problem.pdf (566.36 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03723733 , version 1 (15-07-2022)

Identifiants

Citer

Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville. Hybrid approaches for the two-scenario max-min knapsack problem. International Transactions in Operational Research, 2012, 19, pp.353 - 378. ⟨10.1111/j.1475-3995.2011.00836.x⟩. ⟨hal-03723733⟩
5 Consultations
64 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More