3‐Approximation algorithm for a two depot, heterogeneous traveling salesman problem

3‐Approximation algorithm for a two depot, heterogeneous traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor2012330
Volume: 6
Issue: 1
Start Page Number: 141
End Page Number: 152
Publication Date: Jan 2012
Journal: Optimization Letters
Authors: , ,
Keywords: combinatorial optimization
Abstract:

We present the first approximation algorithm for a two depot, heterogeneous traveling salesman problem with an approximation ratio of 3 when the costs are symmetric and satisfy the triangle inequality.

Reviews

Required fields are marked *. Your email address will not be published.