✦ LIBER ✦

On capacitated network design cut–set polyhedra

✍ Scribed by Alper Atamtürk

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 146 KB
Volume: 92
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070100284

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On cut-based inequalities for capacitate

On cut-based inequalities for capacitated network design polyhedra

✍ Christian Raack; Arie M.C.A. Koster; Sebastian Orlowski; Roland Wessäly 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB

On splittable and unsplittable flow capa

On splittable and unsplittable flow capacitated network design arc–set polyhedra

✍ Alper Atamtürk; Deepak Rajan 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 193 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

A directed cycle-based column-and-cut ge

A directed cycle-based column-and-cut generation method for capacitated survivable network design

✍ Deepak Rajan; Alper Atamtürk 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

## Abstract A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here, we present a polyhedral approach for designing survivable networks. We describe a mixed‐integer programming model, in which sufficient slack is

On the use of guided design search for d

On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem

✍ Mark W. Lewis 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

On a new class of nonlinear set covering

On a new class of nonlinear set covering problems arising in wireless network design

✍ Sandro Bosio 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 117 KB