✦ LIBER ✦

Multicommodity network design with survivability constraints: Some models and algorithms

✍ Scribed by Pietro Belotti

Publisher: Springer
Year: 2005
Tongue: English
Weight: 36 KB
Volume: 3
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-004-0047-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangean-based decomposition algorithm

Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints

✍ Tolga Bektaş; Mervat Chouman; Teodor Gabriel Crainic 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

## Abstract This article discusses problems in the context of multicommodity network design where additional constraints (such as capacity), rather than being imposed in a strict manner, are allowed to be violated at the expense of additional penalty costs. Such penalized cost structures allow thes

Design algorithm for packet-switching ne

Design algorithm for packet-switching networks with different classes of packets-capacity, priority, and flow assignment under endto-end packet delay constraint

✍ Masashi Sugano; Hiromitsu Takashina; Tokumi Yokohira; Takuji Okamoto 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 916 KB

Design procedures for backbone transport

Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations

✍ G. Birkan; J. Kennington 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 820 KB