Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

This publication has 8 references indexed in Scilit:

• Edmonds polytopes and a hierarchy of combinatorial problems
  Published by Elsevier ,2002
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
  Operations Research, 1992
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
  SIAM Journal on Discrete Mathematics, 1990
• Minimum-weight two-connected spanning networks
  Mathematical Programming, 1990
• Computer-aided design procedures for survivable fiber optic networks
  IEEE Journal on Selected Areas in Communications, 1989
• Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints
  Operations Research, 1989
• The traveling salesman problem on a graph and some related integer polyhedra
  Mathematical Programming, 1985
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965