2-change for k-connected networks

DOI10.1016/0167-6377(91)90096-8zbMath0717.90078OpenAlexW2016197501MaRDI QIDQ2638954

Michel X. Goemans, Kalyan T. Talluri

Publication date: 1991

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90096-8

zbMATH Keywords

local searchminimum weightnetwork designlinear programming relaxation2-optk-connected network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (1)

On the domino-parity inequalities for the STSP

Cites Work

• Minimum-weight two-connected spanning networks
• Toughness and Delaunay triangulations
• Traveling salesman cycles are not always subgraphs of Voronoi duals
• Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
• A non-Hamiltonian, nondegenerate Delaunay triangulation
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: 2-change for k-connected networks