Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- 1 August 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 2 (3), 474-504
- https://doi.org/10.1137/0802024
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity ConstraintsOperations Research, 1992
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsSIAM Journal on Discrete Mathematics, 1990
- Minimum-weight two-connected spanning networksMathematical Programming, 1990
- Computer-aided design procedures for survivable fiber optic networksIEEE Journal on Selected Areas in Communications, 1989
- Methods for Designing Communications Networks with Certain Two-Connected Survivability ConstraintsOperations Research, 1989
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965