Robust combinatorial optimization with knapsack uncertainty

Michael Poss 1
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We study in this paper min max robust combinatorial optimization problems for an uncertainty polytope that is defined by knapsack constraints, either in the space of the optimization variables or in an extended space. We provide exact and approximation algorithms that extend the iterative algorithms proposed by Bertismas and Sim (2003). We also study the limitation of the approach and point out NP-hard situations. Then, we approximate axis-parallel ellipsoids with knapsack constraints and provide an approximation scheme for the corresponding robust problem. The approximation scheme is also adapted to handle the intersection of an axis-parallel ellipsoid and a box.
Document type :
Journal articles
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01444717
Contributor : Michael Poss <>
Submitted on : Tuesday, April 17, 2018 - 1:28:08 PM
Last modification on : Friday, October 4, 2019 - 3:52:04 PM

File

draft_DO.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michael Poss. Robust combinatorial optimization with knapsack uncertainty. Discrete Optimization, Elsevier, 2018, 27, pp.88 - 102. ⟨10.1016/j.disopt.2017.09.004⟩. ⟨hal-01444717v3⟩

Share

Metrics

Record views

157

Files downloads

683