𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The multi-facility min-max Weber problem

✍ Scribed by C.D.T. Watson-Gandy

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
515 KB
Volume
18
Category
Article
ISSN
0377-2217

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