A note on approximation algorithms of the clustered traveling salesman problem

DOI10.1016/j.ipl.2017.07.003zbMath1414.68146OpenAlexW2734875663MaRDI QIDQ2398506

Zhaohui Liu, Ganggang Li, Xiaoguang Bao, Wei Yu

Publication date: 16 August 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.07.003

zbMATH Keywords

traveling salesman problemapproximation algorithmsclustered traveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics

Cites Work

• An improved approximation algorithm for the clustered traveling salesman problem
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Approximation Algorithms for Some Postman Problems

This page was built for publication: A note on approximation algorithms of the clustered traveling salesman problem