A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem

DOI10.1007/978-3-642-13731-0_13zbMath1285.90054OpenAlexW1508644659MaRDI QIDQ3569885

Zhou Xu, Brian Rodrigues

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_13

zbMATH Keywords

vehicle routingapproximation algorithmmultiple depots

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Approximation algorithms for multiple terminal, Hamiltonian path problems ⋮ 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem

This page was built for publication: A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem