Truly tight bounds for TSP heuristics

DOI10.1016/J.ORL.2023.06.003zbMATH Open1525.90360OpenAlexW4381547359MaRDI QIDQ6047697FDOQ6047697

Authors: Cor Hurkens 

Publication date: 12 September 2023

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

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

• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the nearest neighbor rule for the traveling salesman problem
• Title not available (Why is that?)
• Lower Bounds for Insertion Methods for TSP
• On the nearest neighbor rule for the metric traveling salesman problem
• Tight bounds for christofides' traveling salesman heuristic
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• TSP with bounded metrics
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)