𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Max algebra and the linear assignment problem

✍ Scribed by Rainer E. Burkard; Peter Butkovic


Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
171 KB
Volume
98
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Complexity of the min–max and min–max re
✍ 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