Truly tight bounds for TSP heuristics

DOI10.1016/J.ORL.2023.06.003MaRDI QIDQ6047697zbMATH OpenOpenAlexFDO

Authors Cor Hurkens

Publication date 12 September 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.orl.2023.06.003

zbMATH Keywords

worst-case analysismatching boundsTSP-heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Eulerian and Hamiltonian graphs (05C45)

Cites work

• scientific article; zbMATH DE number 3918121 (Why is no real title available?)
• scientific article; zbMATH DE number 3950233 (Why is no real title available?)
• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 3630482 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Lower Bounds for Insertion Methods for TSP
• On the nearest neighbor rule for the metric traveling salesman problem
• On the nearest neighbor rule for the traveling salesman problem
• Tight bounds for christofides' traveling salesman heuristic

Cited in

(4)

• TSP with bounded metrics
• scientific article; zbMATH DE number 1754594 (Why is no real title available?)
• scientific article; zbMATH DE number 5855014 (Why is no real title available?)
• Quick updates for \(p\)-opt TSP heuristics

This page was built for publication: Truly tight bounds for TSP heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047697)