Strong inequalities for capacitated survivable network design problems.

DOI10.1007/s101070000187zbMath1033.90138MaRDI QIDQ5926334

Muratore, Gabriella, Bienstock, Daniel

Publication date: 18 February 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

facet-defining inequalitiesnetwork with multicommodity demandspolyhedrasurvivability constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Related Items (13)

Survivable network design with shared-protection routing ⋮ Information security: Designing a stochastic-network for throughput and reliability ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Unnamed Item ⋮ Valid inequalities and separation for capacitated fixed charge flow problems ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Models and Algorithms for Intermodal Transportation and Equipment Selection ⋮ Polyhedral structure of the 4-node network design problem ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ A directed cycle-based column-and-cut generation method for capacitated survivable network design

This page was built for publication: Strong inequalities for capacitated survivable network design problems.