𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Hassene Aissi

Publisher
Springer
Year
2006
Tongue
English
Weight
67 KB
Volume
4
Category
Article
ISSN
1619-4500

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

Dynamic programming and a max-min proble
Dynamic programming and a max-min problem in the theory of structures
✍ Nestor Distefano 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A max-min problem in the realm of optimum beam design is formulated and thoroughly investigated from a dynamic programming point of view. It is shown that the conditions of optimality can be directly derived from the Hamilton-Jacobi-Bellman equation of the process. The classical Euler-Lagrange equat