Title of article
(p − 1)(p + 1)-approximate
Author/Authors
Igor Averbakh، نويسنده , , Oded Berman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
16
From page
201
To page
216
Abstract
Suppose p traveling salesmen must visit together all points/nodes of a tree, and the objective is to minimize the maximum of lengths of their tours. For location-allocation problems (where both optimal home locations of the salesmen and their tours must be found), which are NP-complete, fast polynomial heuristics with worst-case relative error (p − 1)(p + 1) are presented.
Keywords
Traveling salesman , Approximate algorithms , Complexity
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884539
Link To Document