Optimization problems in graphs with locational uncertainty - Analyse numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Optimization problems in graphs with locational uncertainty

Marin Bougeret
Michael Poss

Résumé

Many discrete optimization problems amount to selecting a feasible subgraph of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets. The objective is to minimize the sum of the distances in the chosen subgraph for the worst positions of the vertices in their uncertainty sets. We first prove that these problems are NP-hard even when the feasible subgraphs consist either of all spanning trees or of all s − t paths. Given this hardness, we propose an exact solution algorithm combining integer programming formulations with a cutting plane algorithm, identifying the cases where the separation problem can be solved efficiently. We also propose a conservative approximation and show its equivalence to the affine decision rule approximation in the context of Euclidean distances. We compare our algorithms to three deterministic reformulations on instances inspired by the scientific literature for the Steiner tree problem and a facility location problem.
Fichier principal
Vignette du fichier
IJOC-revision.pdf (771.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03331166 , version 1 (01-09-2021)
hal-03331166 , version 2 (03-09-2021)
hal-03331166 , version 3 (04-05-2022)
hal-03331166 , version 4 (27-09-2022)
hal-03331166 , version 5 (20-12-2023)

Identifiants

  • HAL Id : hal-03331166 , version 4

Citer

Marin Bougeret, Jérémy Omer, Michael Poss. Optimization problems in graphs with locational uncertainty. 2022. ⟨hal-03331166v4⟩
246 Consultations
311 Téléchargements

Partager

Gmail Facebook X LinkedIn More