Some tractable instances of interval data minmax regret problemsReport as inadecuate




Some tractable instances of interval data minmax regret problems - Download this document for free, or read online. Document in PDF available to download.

1 DECISION LIP6 - Laboratoire d-Informatique de Paris 6

Abstract : 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.






Author: Bruno Escoffier Jérôme Monnot Olivier Spanjaard -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents