3 search results - page 1 / 1 » Partition inequalities for capacitated survivable network de... |
96
Voted
DISOPT
2008
15 years 7 days ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
122
Voted
NETWORKS
2011
14 years 7 months ago
2011
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
105
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...