✦ LIBER ✦

An approximation algorithm for network design problems with downwards-monotone demand functions

✍ Scribed by Michael Laszlo; Sumitra Mukherjee

Book ID: 107402380
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 167 KB
Volume: 2
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-007-0051-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for a network design problem

Algorithms for a network design problem with crossing supermodular demands

✍ Vardges Melkonian; Éva Tardos 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

An approximation algorithm for a facilit

An approximation algorithm for a facility location problem with stochastic demands and inventories

✍ A.F. Gabor; J.C.W. van Ommeren 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 176 KB

We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating

Monotonicity with respect to functional

Monotonicity with respect to functional of an iterative algorithm for the block problem with random parameters

✍ Yu.A. Belov 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 468 KB

An approximation algorithm for the minim

An approximation algorithm for the minimum two peripatetic salesmen problem with different weight functions

✍ Glebov, A. N.; Zambalaeva, D. Zh. 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 678 KB