Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
From MaRDI portal
Publication:1586139
DOI10.1007/S004530010045zbMath0963.68226OpenAlexW2043916130MaRDI QIDQ1586139
Refael Hassin, Samir Khuller, Balaji Raghavachari, Nili Guttmann-Beck
Publication date: 14 November 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010045
Related Items (35)
On the minimum routing cost clustered tree problem ⋮ On residual approximation in solution extension problems ⋮ A LP-based approximation algorithm for generalized traveling salesperson path problem ⋮ Approximation Algorithms for Not Necessarily Disjoint Clustered TSP ⋮ GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ A note on approximation algorithms of the clustered traveling salesman problem ⋮ Picker Routing in AGV-Assisted Order Picking Systems ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ The hierarchical traveling salesman problem ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems ⋮ An LP-based approximation algorithm for the generalized traveling salesman path problem ⋮ Heuristics for a cash-collection routing problem with a cluster-first route-second approach ⋮ The Clustered Selected-Internal Steiner Tree Problem ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ On Residual Approximation in Solution Extension Problems ⋮ Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem ⋮ Achieving feasibility for clustered traveling salesman problems using PQ‐trees ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ The traveling salesman problem with flexible coloring ⋮ An improved approximation algorithm for the clustered traveling salesman problem ⋮ An exact algorithm for the clustered travelling salesman problem ⋮ Traveling salesman path problems ⋮ Approximation algorithms for multiple terminal, Hamiltonian path problems ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) ⋮ Approximation algorithms for general cluster routing problem ⋮ On the Hardness of Reoptimization ⋮ A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots ⋮ Reassembling Trees for the Traveling Salesman ⋮ Structural Properties of Hard Metric TSP Inputs ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ Approximation algorithms with constant ratio for general cluster routing problems ⋮ On the Clustered Steiner Tree Problem ⋮ On the clustered Steiner tree problem ⋮ Order sequencing on a unidirectional cyclical picking line
This page was built for publication: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
