A Multilevel Approach to the Travelling Salesman Problem

DOI10.1287/OPRE.50.5.862.373zbMath1163.90777OpenAlexW2120348968MaRDI QIDQ3635145

Chris Walshaw

Publication date: 3 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.50.5.862.373

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (8)

On global integer extrema of real-valued box-constrained multivariate quadratic functions ⋮ SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition ⋮ A multilevel optimization approach for large scale battery exchange station location planning ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Unnamed Item ⋮ Implementation analysis of efficient heuristic algorithms for the traveling salesman problem ⋮ Fast local search algorithms for the handicapped persons transportation problem

Uses Software

• Unnamed Item
• Scotch

This page was built for publication: A Multilevel Approach to the Travelling Salesman Problem