Sciweavers

NETWORKS
2011
15 years 10 days ago
On cut-based inequalities for capacitated network design polyhedra
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...
Christian Raack, Arie M. C. A. Koster, Sebastian O...