Some tractable instances of interval data minmax regret problems

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 well known solvable 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. Keyword Robust optimization; Interval data; Shortest path; Spanning tree; Bipartite perfect matching

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
• Keywords: Data Minmax Regret, Interval Data Minmax, ORL 2008, Shortest Path