✦ LIBER ✦

Min-Max-Intervallrechnung

✍ Scribed by K.-U. Jahn

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 331 KB
Volume: 71
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19760710122

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 bird's eye-view of min-max and max-min

A bird's eye-view of min-max and max-min functionals

✍ M.J. Kaiser 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 878 KB

On max-min problems

✍ Kailash C. Kapur 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

A Min Max theorem

✍ Raul F Manasevich 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Reflected min-max heaps

✍ Christos Makris; Athanasios Tsakalidis; Kostas Tsichlas 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 98 KB

In this paper we present a simple and efficient implementation of a min-max priority queue, reflected min-max priority queues. The main merits of our construction are threefold. First, the space utilization of the reflected min-max heaps is much better than the naive solution of putting two heaps ba

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