4 search results - page 1 / 1 » On cut-based inequalities for capacitated network design pol... |
MP
2002
13 years 10 months ago
2002
We study the polyhedra of splittable and unsplittable single arc
NETWORKS
2011
13 years 5 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...
MP
2002
13 years 10 months ago
2002
Abstract. This paper provides an analysis of capacitated network design cut
DISOPT
2008
13 years 11 months 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...