✦ LIBER ✦

Max-Min Problems on the Ranks and Inertias of

✍ Scribed by Yonghui Liu; Yongge Tian

Publisher: Springer
Year: 2010
Tongue: English
Weight: 667 KB
Volume: 148
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-010-9760-8

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

On the solution of some max-min problems

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

On max-min problems

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

One strike against the min-max degree tr

One strike against the min-max degree triangulation problem

✍ Klaus Jansen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 718 KB

On a Max-min Problem Concerning Weights

On a Max-min Problem Concerning Weights of Edges

✍ Stanislav Jendrol'; Ingo Schiermeyer 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 159 KB