𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic Min-Max Problems

✍ Scribed by Uwe Schwiegelshohn; Lothar Thiele

Book ID
110263428
Publisher
Springer
Year
1999
Tongue
English
Weight
247 KB
Volume
9
Category
Article
ISSN
0924-6703

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On max-min problems
On max-min problems
✍ Kailash C. Kapur πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 198 KB
A min max problem
A min max problem
✍ S. Bansal; M. C. Puri πŸ“‚ Article πŸ“… 1980 πŸ› Springer 🌐 English βš– 307 KB
Min-Max quickest path problems
Min-Max quickest path problems
✍ Stefan Ruzika; Markus Thiemann πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 106 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 linear maxβ€”min problem
A linear maxβ€”min problem
✍ James E. Falk πŸ“‚ Article πŸ“… 1973 πŸ› Springer-Verlag 🌐 English βš– 774 KB