Strong inequalities for capacitated survivable network design problems.
From MaRDI portal
Recommendations
- A polyhedral approach to multicommodity survivable network design
- On cut-based inequalities for capacitated network design polyhedra
- Design of survivable networks using three- and four-partition facets
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- More facets for survivable networks
Cited in
(15)- A polyhedral approach to multicommodity survivable network design
- Valid inequalities and separation for capacitated fixed charge flow problems
- Survivable network design with shared-protection routing
- Single-Sink Multicommodity Flow with Side Constraints
- Polyhedral structure of the 4-node network design problem
- On cut-based inequalities for capacitated network design polyhedra
- Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
- Unsplittable non-additive capacitated network design using set functions polyhedra
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- Multicommodity network flows: a survey. I: Applications and formulations
- Models and algorithms for intermodal transportation and equipment selection
- Information security: Designing a stochastic-network for throughput and reliability
- Valid inequalities and facets for multi‐module survivable network design problem
- Robust capacitated Steiner trees and networks with uniform demands
- Partition inequalities for capacitated survivable network design based on directed p-cycles
This page was built for publication: Strong inequalities for capacitated survivable network design problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926334)
