Title of article
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree Original Research Article
Author/Authors
Igor Averbakh، نويسنده , , Oded Berman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
16
From page
17
To page
32
Abstract
Suppose two travelling salesmen must visit together all points/nodes of a tree, and the objective is to minimize the maximal length of their tours. Home locations of the salesmen are given, and it is required to find optimal tours. For this NP-hard problem a heuristic with complexity O(n) is presented. The worst-case relative error for the heuristic performance is 13 for the case of equal home locations for both servers and 12 for the case of different home locations.
Keywords
Worst-case analysis , Algorithms , Travelling salesman problem
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884393
Link To Document