Quick updates for \(p\)-opt TSP heuristics

DOI10.1016/0167-6377(92)90061-7zbMath0756.90090OpenAlexW2039909249MaRDI QIDQ1198624

Margot, François

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90061-7

zbMATH Keywords

traveling salesmanexchange heuristicsLin-type \(p\)-opt exchanges

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Routing problems: A bibliography ⋮ Genetic algorithms and traveling salesman problems ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic

Cites Work

• Probabilistic exchange algorithms and Euclidean traveling salesman problems
• Computer Solutions of the Traveling Salesman Problem
• Unnamed Item

This page was built for publication: Quick updates for \(p\)-opt TSP heuristics