Three value TSP and linkages with the three value linear spanning 2-forests

DOI10.1016/j.dam.2011.08.019zbMath1235.90169MaRDI QIDQ765337

Abraham P. Punnen, Daniel K. Benvenuti

Publication date: 19 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.019

zbMATH Keywords

traveling salesman problem; constant TSP; disjoint spanning 2-paths; linear two forests

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognition of Gilmore-Gomory traveling salesman problem
• A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• Graphs in which all Hamiltonian cycles have the same length
• Weighted graphs with all Hamiltonian cycles of the same length
• Hamiltonian path and symmetric travelling salesman polytopes
• Properties of the trajectories of the appointments problem and the travelling-salesman problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Study of an algorithm for solving the travelling salesman problem
• On constant-weight TSP-tours
• On cost matrices with two and three distinct values of Hamiltonian paths and cycles