✦ LIBER ✦

Approximation Algorithms for a Capacitated Network Design Problem

✍ Scribed by Refael Hassin; R. Ravi; F. Sibel Salman

Publisher: Springer
Year: 2003
Tongue: English
Weight: 804 KB
Volume: 38
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-003-1069-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Soft-Capaci

Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design

✍ Xujin Chen; Bo Chen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 796 KB

Approximation algorithms for the capacit

Approximation algorithms for the capacitated plant allocation problem

✍ Martine Labbé; E.F. Schmeichel; S.Louis Hakimi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 510 KB

A branch-and-cut algorithm for capacitat

A branch-and-cut algorithm for capacitated network design problems

✍ Oktay Günlük 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 173 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

Decomposition algorithms for the design

Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network

✍ April K. Andreas; J. Cole Smith 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

A capacity scaling heuristic for the mul

A capacity scaling heuristic for the multicommodity capacitated network design problem

✍ N. Katayama; M. Chen; M. Kubo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 570 KB