𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of minimum corridor guarding problems

✍ Scribed by Ning Xu

Book ID
116577125
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
185 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cardinality constrained minimum cut prob
Cardinality constrained minimum cut problems: complexity and algorithms
✍ Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 377 KB

In several applications the solutions of combinatorial optimization problems (COP) are required to satisfy an additional cardinality constraint, that is to contain a ΓΏxed number of elements. So far the family of (COP) with cardinality constraints has been little investigated. The present work tackle

Minimum-cost strong network orientation
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
✍ Burkard, Rainer E.; Feldbacher, Karin; Klinz, Bettina; Woeginger, Gerhard J. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

In the minimum-cost strong network orientation problem (MCSO), we are given an undirected graph G Γ… (V, E) with nonnegative edge lengths ᐉ(e) and a transportation schedule T Γ… {(s 1 , t 1 , w 1 ), . . . , (s k , t k , w k )}, where w i units of weight have to be transported from the source vertex s