Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
From MaRDI portal
Publication:1302598
DOI10.1016/S0305-0548(98)00065-3zbMath0968.90057MaRDI QIDQ1302598
Publication date: 23 September 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Search theory (90B40) Combinatorial optimization (90C27)
Related Items (9)
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ On the theoretical properties of swap multimoves ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ Construction heuristics for the asymmetric TSP. ⋮ A survey of very large-scale neighborhood search techniques ⋮ TSP tour domination and Hamilton cycle decompositions of regular digraphs ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ Local search with an exponential neighborhood for the servers load balancing problem
Uses Software
This page was built for publication: Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
