New edges not used in shortest tours of TSP

DOI10.1016/S0377-2217(96)00326-8zbMath0955.90109MaRDI QIDQ1291639

Katsuaki Sakakibara

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesman problemphilosophygeometric

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Determination of the candidate arc set for the asymmetric traveling salesman problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• A restricted Lagrangean approach to the traveling salesman problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• The Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New edges not used in shortest tours of TSP