Minimum-weight two-connected spanning networks

This publication has 24 references indexed in Scilit:

• Send-and-Split Method for Minimum-Concave-Cost Network Flows
  Mathematics of Operations Research, 1987
• The traveling salesman problem on a graph and some related integer polyhedra
  Mathematical Programming, 1985
• On the relationship between the biconnectivity augmentation and travelling salesman problems
  Theoretical Computer Science, 1982
• On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
  Networks, 1982
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
  Management Science, 1980
• Tight bounds for christofides' traveling salesman heuristic
  Mathematical Programming, 1978
• Augmentation Problems
  SIAM Journal on Computing, 1976
• The steiner problem in graphs
  Networks, 1971
• 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
• On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
  Operations Research, 1959