On common edges in optimal solutions to traveling salesman and other optimization problems

DOI10.1016/0166-218X(88)90057-1zbMath0648.90082MaRDI QIDQ1105496

S. H. Smith

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treecomplete graphsymmetric traveling salesmancommon edgesminimum perfect matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Paths and cycles (05C38)

Related Items (2)

Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Some graphic uses of an even number of odd nodes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parity results on connected f-factors
• Spanning cycles of nearly cubic graphs
• Parity theorems for paths and cycles in graphs
• A census of maximum uniquely hamiltonian graphs
• Graphs with exactly one hamiltonian circuit
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: On common edges in optimal solutions to traveling salesman and other optimization problems