Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints

This publication has 10 references indexed in Scilit:

• Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints
  Operations Research, 1989
• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• The traveling salesman problem on a graph and some related integer polyhedra
  Mathematical Programming, 1985
• Steiner trees, connected domination and strongly chordal graphs
  Networks, 1985
• On the History of the Minimum Spanning Tree Problem
  IEEE Annals of the History of Computing, 1985
• Testing membership in matroid polyhedra
  Journal of Combinatorial Theory, Series B, 1984
• Feature Article—The Ellipsoid Method: A Survey
  Operations Research, 1981
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Matroids and the greedy algorithm
  Mathematical Programming, 1971
• Multi-Terminal Network Flows
  Journal of the Society for Industrial and Applied Mathematics, 1961