Approximation algorithms for the min-max clustered k-traveling salesmen problems

DOI10.1016/J.TCS.2022.08.030MaRDI QIDQ2676463zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoguang Bao, Wei Yu, Wei Song, Lei Xu

Publication date 27 September 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.08.030

zbMATH Keywords

approximation algorithmclustered traveling salesman problemmin-maxtraveling salesman problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 1302021
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• An improved approximation algorithm for the clustered traveling salesman problem
• An approximation algorithm for the clustered path travelling salesman problem
• scientific article; zbMATH DE number 1379308

Cites work

• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• An improved approximation algorithm for the clustered traveling salesman problem
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximation Algorithms for Min-Max Cycle Cover Problems
• Approximation algorithms for some min-max postmen cover problems
• Approximation Algorithms for Some Postman Problems
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Approximations for minimum and min-max vehicle routing problems
• Arc Routing Problems, Part II: The Rural Postman Problem
• Better approximability results for min-max tree/cycle/path cover problems
• Exact algorithms for the clustered vehicle routing problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Min-max tree covers of graphs.
• On general routing problems
• Restricted delivery problems on a network
• Solving the family traveling salesman problem
• Some applications of the clustered travelling salesman problem
• The complexity of arc routing problems

Cited in

(3)

• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization
• A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem

This page was built for publication: Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems

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