𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the min–max (regret) selecting items problem

✍ Scribed by Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł


Book ID
119262892
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
220 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Complexity of the min–max and min–max re
✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 179 KB

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro