✦ LIBER ✦

On the Solution of Min-sum-min Problems

✍ Scribed by Alexei Demyanov

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 136 KB
Volume: 31
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-004-7018-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the solution of some max-min problems

✍ A. I. Propoi; R. G. Vachnadze 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 480 KB

Max-min sum minimization transportation

Max-min sum minimization transportation problem

✍ Sonia Puri; M. C. Puri 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 72 KB

Max-min sum minimization transportation

Max-min sum minimization transportation problem

✍ Sonia Puri; M. C. Puri 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 357 KB

Solving combinatorial problems with comb

Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications

✍ M. Minoux 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 591 KB

On max-min problems

✍ Kailash C. Kapur 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 198 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