𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks

✍ Scribed by Iradj Ouveysi; Andrew Wirth; Annie Yeh; Osman Oğuz

Book ID
111570818
Publisher
Springer US
Year
2003
Tongue
English
Weight
78 KB
Volume
124
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A combined Lagrangian, linear programmin
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
✍ A. Atamtürk; G. L. Nemhauser; M. W. P. Savelsbergh 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 685 KB

Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high

On design of a survivable network archit
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
✍ Iradj Ouveysi; Andrew Wirth 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We investigate network planning and design under volatile conditions of link failures and trac overload. Our model is a non-simultaneous multi-commodity problem, with any particular two link failure being considered as one scenario. We show that the optimal solution model is not practically solvable