Strong inequalities for capacitated survivable network design problems.
From MaRDI portal
Publication:5926334
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)
facet-defining inequalities; network with multicommodity demands; polyhedra; survivability constraints
90C35: Programming involving graphs or networks
68M10: Network design and communication in computer systems
90B10: Deterministic network models in operations research
Related Items
A directed cycle-based column-and-cut generation method for capacitated survivable network design, Models and Algorithms for Intermodal Transportation and Equipment Selection, Information security: Designing a stochastic-network for throughput and reliability, Survivable network design with shared-protection routing, Unsplittable non-additive capacitated network design using set functions polyhedra, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Valid inequalities and separation for capacitated fixed charge flow problems, Single-Sink Multicommodity Flow with Side Constraints, Polyhedral structure of the 4-node network design problem