𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On max-min problems

✍ Scribed by Kailash C. Kapur

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
198 KB
Volume
20
Category
Article
ISSN
0894-069X

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

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

Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
✍ Ishwar Murthy; Shenq-Shyong Her πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri