Skip to main content
SpringerLink
Log in

Strong inequalities for capacitated survivable network design problems

  • Published:
Mathematical Programming Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Columbia University, New York, NY 10027, , , , , , US

    Daniel Bienstock & Gabriella Muratore

Authors
  1. Daniel Bienstock
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriella Muratore
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: December 1997 / Accepted: April 2000¶Published online September 20, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bienstock, D., Muratore, G. Strong inequalities for capacitated survivable network design problems. Math. Program. 89, 127–147 (2000). https://doi.org/10.1007/PL00011390

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00011390

Search

Navigation