Some tractable instances of interval data minmax regret problems

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

1 DECISION

In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes 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.

Domaines: Informatique [cs]

Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems. Operations Research Letters, 2008, 36 (4), pp.424-429. ⟨10.1016/j.orl.2007.12.004⟩. ⟨hal-01170223⟩