✦ 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
DOI: 10.1016/j.ipl.2012.10.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Min–max and min–max (relative) regret ap

Min–max and min–max (relative) regret approaches to representatives selection problem

✍ Dolgui, Alexandre; Kovalev, Sergey 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 202 KB

Approximation and resolution of min–max

Approximation and resolution of min–max and min–max regret versions of combinatorial optimization problems

✍ Hassene Aissi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 67 KB

Complexity of the min–max and min–max re

Complexity of the min–max and min–max regret assignment problems

✍ 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

A randomized algorithm for the min-max s

A randomized algorithm for the min-max selecting items problem with uncertain weights

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 311 KB

Complexity of the min–max (regret) versi

Complexity of the min–max (regret) versions of min cut problems

✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Approximation schemes for the Min-Max St

Approximation schemes for the Min-Max Starting Time Problem

✍ Leah Epstein; Tamir Tassa 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 193 KB