A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
From MaRDI portal
Publication:3569885
DOI10.1007/978-3-642-13731-0_13zbMath1285.90054MaRDI QIDQ3569885
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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
Approximation algorithms for multiple terminal, Hamiltonian path problems, 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem