𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A min max problem

✍ Scribed by S. Bansal; M. C. Puri

Publisher
Springer
Year
1980
Tongue
English
Weight
307 KB
Volume
24
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A nonconvex max-min problem
A nonconvex max-min problem
✍ James E. Falk; Karla Hoffman πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 483 KB

## Abstract An algorithm designed to solve a large class of nonconvex max‐min problems is described. Its usefulness and applicability is demonstrated by solving an extension of a recently introduced model which optimally allocates strategic weapon systems. The extended model is shown to be equivale

A linear maxβ€”min problem
A linear maxβ€”min problem
✍ James E. Falk πŸ“‚ Article πŸ“… 1973 πŸ› Springer-Verlag 🌐 English βš– 774 KB
On max-min problems
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