Distances between traveling salesman tours

DOI10.1016/0166-218X(93)E0115-FzbMath0835.90113OpenAlexW2125113804MaRDI QIDQ1805446

Yanyan Li

Publication date: 17 May 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0115-f

zbMATH Keywords

traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic

Cites Work

• Unnamed Item
• A modified Lin--Kernighan traveling-salesman heuristic
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Distances between traveling salesman tours