On capacitated network design cut–set polyhedra

This paper provides an analysis of capacitated network design cut–set polyhedra. We give a complete linear description of the cut–set polyhedron of the single commodity–single facility capacitated network design problem. Then we extend the analysis to single commodity–multifacility and multicommodity–multifacility capacitated network design problems. Valid inequalities described here are applicable to directed network design problems with any number of facility types and any level of capacities. We report results from a computational study done for testing the effectiveness of the new inequalities.