Some tractable instances of interval data minmax regret problems: bounded distance from triviality

Bruno Escoffier (1) , Jérôme Monnot (1) , Olivier Spanjaard (2)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 DECISION

This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distance from trivial instances. Tractable cases occur when the parameter is bounded by a constant. Two kinds of parameters are investigated, measuring either the distance from special weight structures or the distance from special graph structures.

Mots clés: Robust optimization; Interval data; Shortest path; Spanning tree; Bipartite perfect matching

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems: bounded distance from triviality. 2007. ⟨hal-00179399⟩