The 2 Travelling Salesmen Location Problem on a Straight Line
直线上的双旅行售货员位置问题

The travelling salesman location problem is one of extremely difficult problems in combinatorial optimization.Due to its difficulty (it involves simutaneously solutions of both travelling salesman problems and location problems) the problem has attracted limited attention so far.The problem with more than one travelling salesmen has not been inves tigated yet.In this paper we develop an O(n 4) algorithm for solving the problem with two travelling salesmen on a straight line.