Knapsack problem with objective value gaps - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2017

Knapsack problem with objective value gaps

Résumé

We study a 0-1 knapsack problem, in which the objective value is forbidden to take some values. We call gaps related forbidden intervals. The problem is NP-hard and pseudo-polynomially solvable independently on the measure of gaps. If the gaps are large, then the problem is polynomially non-approximable. A non-trivial special case with respect to the approximate solution appears when the gaps are small and polynomially close to zero. For this case, two fully polynomial time approximation schemes are proposed. The results can be extended for the constrained longest path problem and other combinatorial problems.
Fichier principal
Vignette du fichier
Knapsack Gaps 7 March 2016.pdf (211.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01315452 , version 1 (13-05-2016)

Identifiants

Citer

Alexandre Dolgui, Mikhail Y. Kovalyov, Alain Quilliot. Knapsack problem with objective value gaps. Optimization Letters, 2017, 11 (1), pp.31-39. ⟨10.1007/s11590-016-1043-3⟩. ⟨hal-01315452⟩
265 Consultations
450 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More