✦ LIBER ✦

On cut-based inequalities for capacitated network design polyhedra

✍ Scribed by Christian Raack; Arie M.C.A. Koster; Sebastian Orlowski; Roland Wessäly

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 375 KB
Volume: 57
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20395

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A continuous network design model in sto

A continuous network design model in stochastic user equilibrium based on sensitivity analysis

✍ Yongtaek Lim; Benjamin G Heydecker; Seungjae Lee 📂 Article 📅 2005 🏛 Institute for Transportation Inc. 🌐 English ⚖ 579 KB

The continuous network design problem (CNDP) is known to be difficult to solve due to the intrinsic properties of non-convexity and nonlinearity. Such kinds of CNDP can be formulated as a bi-level programme, in which the upper level represents the designer's decisions and the lower level the travell