| Article ID: | iaor20013559 |
| Country: | Germany |
| Volume: | 89 |
| Issue: | 1 |
| Start Page Number: | 127 |
| End Page Number: | 147 |
| Publication Date: | Jan 2000 |
| Journal: | Mathematical Programming |
| Authors: | Bienstock D., Muratore G. |
| Keywords: | polyhedra |
We present several classes of facet-defining inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex- or edge-deletion at least some prescribed fraction of each demand can be routed.