Contributions to robust combinatorial optimization with budgeted 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 : Robust optimization (RO) has become a central framework to handle the uncertainty that arises in the parameters of optimization problems. While classical RO results can efficiently handle linear programs for a large variety of uncertainty sets, the situation is more complex for optimization problems involving discrete decisions. Efficient exact or approximate solution algorithms for such problems must exploit the combinatorial structure of the problems at hand. This thesis uses the budgeted uncertainty set, introduced by Bertsimas and Sim in (2003,2004), to address scheduling problems, vehicle routing problems, constrained shortest path problems, and lot-sizing problems. We address the resulting robust combinatorial optimization problems along two complementary set of tools: exact and approximate combinatorial algorithms, and decomposition algorithms based on integer programming formulations. In addition to the results specific to each problem, we present an extension of the budgeted uncertainty that is motivated by a connection with probabilistic constraints.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

https://hal.archives-ouvertes.fr/tel-01421260
Contributor : Michael Poss <>
Submitted on : Tuesday, December 27, 2016 - 10:55:56 AM
Last modification on : Friday, May 17, 2019 - 11:39:09 AM
Long-term archiving on : Tuesday, March 21, 2017 - 9:24:14 AM

Identifiers

  • HAL Id : tel-01421260, version 1

Collections

Citation

Michael Poss. Contributions to robust combinatorial optimization with budgeted uncertainty. Operations Research [cs.RO]. Université de Montpellier, 2016. ⟨tel-01421260⟩

Share

Metrics

Record views

535

Files downloads

935