The 2-edge-connected subgraph polyhedron

DOI10.1007/s10878-005-1777-9zbMath1093.90051MaRDI QIDQ2576774

Nemhauser, George I., Dieter Vandenbussche

Publication date: 14 December 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-1777-9

zbMATH Keywords

polyhedra; traveling salesman problem; network design; edge-connectivity

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Uses Software

• Concorde
• PORTA

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman problem in graphs with some excluded minors
• Two-edge connected spanning subgraphs and polyhedra
• On perfectly two-edge connected graphs
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• On two-connected subgraph polytopes
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• On the symmetric travelling salesman problem I: Inequalities
• The traveling salesman problem on a graph and some related integer polyhedra
• Small Travelling Salesman Polytopes
• The Binested Inequalities for the Symmetric Traveling Salesman Polytope
• Minimally 2-edge connected graphs
• The k-Edge-Connected Spanning Subgraph Polyhedron
• An Integer Polytope Related to the Design of Survivable Communication Networks