Upper bounds on ATSP neighborhood size.

DOI10.1016/S0166-218X(03)00181-1zbMath1126.90413MaRDI QIDQ1406047

Anders Yeo, Gregory Gutin

Publication date: 9 September 2003

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

zbMATH Keywords

TSPATSPUpper boundsExponential neighborhoods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Further extension of the TSP assign neighborhood

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential neighbourhood local search for the traveling salesman problem
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
• Domination analysis of some heuristics for the traveling salesman problem
• The Travelling Salesman and the PQ-Tree
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
• A new heuristic for the traveling salesman problem
• TSP tour domination and Hamilton cycle decompositions of regular digraphs

This page was built for publication: Upper bounds on ATSP neighborhood size.