Minmax p-Traveling Salesmen Location Problems on a Tree |
| |
Authors: | Igor Averbakh Oded Berman |
| |
Institution: | (1) Division of Management, University of Toronto at Scarborough, Scarborough, Ontario, M1C 1A4, Canada;(2) Rotman School of Management, University of Toronto, Toronto, Ontario, M5S 3E6, Canada |
| |
Abstract: | Suppose that p traveling salesmen must visit together all points of a tree, and the objective is to minimize the maximum of the lengths of their tours. The location–allocation version of the problem (where both optimal home locations of the salesmen and their optimal tours must be found) is known to be NP-hard for any p2. We present exact polynomial algorithms with a linear order of complexity for location versions of the problem (where only optimal home locations must be found, without the corresponding tours) for the cases p=2 and p=3. |
| |
Keywords: | polynomial algorithm location traveling salesman problem |
本文献已被 SpringerLink 等数据库收录! |
|