✦ LIBER ✦

Some tractable instances of interval data minmax regret problems

✍ Scribed by Bruno Escoffier; Jérôme Monnot; Olivier Spanjaard

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 317 KB
Volume: 36
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval data minmax regret network opti

Interval data minmax regret network optimization problems

✍ Igor Averbakh; Vasilij Lebedev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 312 KB

We consider the minimum spanning tree and the shortest path problems on a network with uncertain lengths of edges. In particular, for any edge of the network, only an interval estimate of the length of the edge is known, and it is assumed that the length of each edge can take on any value from the c

On the existence of an FPTAS for minmax

On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 172 KB

A 2-approximation algorithm for interval

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 182 KB