✦ LIBER ✦

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

✍ Scribed by Dolgui, Alexandre; Kovalev, Sergey

Book ID: 111973007
Publisher: Springer
Year: 2012
Tongue: English
Weight: 202 KB
Volume: 10
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-012-0202-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Approximating the min–max (regret) selec

Approximating the min–max (regret) selecting items problem

✍ Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Scenario relaxation algorithm for finite

Scenario relaxation algorithm for finite scenario-based min–max regret and min–max relative regret robust optimization

✍ Tiravat Assavapokee; Matthew J. Realff; Jane C. Ammons; I-Hsuan Hong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 165 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

A min-max regret approach to unbalanced

A min-max regret approach to unbalanced bidding in construction

✍ Abbas Afshar; Helia Amiri 📂 Article 📅 2010 🏛 Korean Society of Civil Engineers 🌐 English ⚖ 454 KB

A min-max approach to storage control pr

A min-max approach to storage control problems

✍ S. Orlovski; S. Rinaldi; R. Soncini-Sessa 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 993 KB