𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of min–max subsequence problems

✍ Scribed by Wil Michiels; Jan Korst

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
93 KB
Volume
87
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Min–max subsequence problems in multi-zo
Min–max subsequence problems in multi-zone disk recording
✍ Wil Michiels; Jan Korst 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 188 KB

We study the problem of ordering a collection of n numbers such that the maximum sum of k successive numbers is minimized. The problem occurs in the design of video servers and in-home hard disk recorders used for storage of video ÿles. By alternately assigning the successive data blocks of a video

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

On max-min problems
On max-min problems
✍ Kailash C. Kapur 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB
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