✦ LIBER ✦

An approximation algorithm for thek-median warehouse-retailer network design problem

✍ Scribed by Li, Yu; Xiu, NaiHua; Xu, DaChuan

Book ID: 121609021
Publisher: SP Science China Press
Year: 2013
Tongue: English
Weight: 166 KB
Volume: 56
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-013-4704-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the hiera

An approximation algorithm for the hierarchical median problem

✍ V. V. Shenmaier 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 449 KB

An approximation algorithm for thek-leve

An approximation algorithm for thek-level capacitated facility location problem

✍ Donglei Du; Xing Wang; Dachuan Xu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 302 KB

An iterative rounding 2-approximation al

An iterative rounding 2-approximation algorithm for thek-partial vertex cover problem

✍ Tu, Jian-hua; Du, Jun-feng; Yang, Feng-mei 📂 Article 📅 2014 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 204 KB

Approximation Algorithms for a Capacitat

Approximation Algorithms for a Capacitated Network Design Problem

✍ Refael Hassin; R. Ravi; F. Sibel Salman 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 804 KB

Approximate algorithms for the discrete

Approximate algorithms for the discrete network design problem

✍ Poorzahedy, Hossain; Turnquist, Mark A. 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 918 KB

Approximation Algorithms for Network Des

Approximation Algorithms for Network Design Problems on Bounded Subsets

✍ Dorit S. Hochbaum; Joseph (Seffi) Naor 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher