Global strategies for augmenting the efficiency of TSP heuristics

DOI10.1007/3-540-57155-8_253zbMath1504.90203OpenAlexW1527934764MaRDI QIDQ5060118

Giovanni Manzini, Luciano Margara, Giovanni Resta, Bruno Codenotti

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_253

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• How easy is local search?
• Large-step Markov chains for the TSP incorporating local search heuristics
• Approximate Traveling Salesman Algorithms
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Global strategies for augmenting the efficiency of TSP heuristics