Xu, Liang; Xu, Zhou; Xu, Dongsheng - In: European Journal of Operational Research 227 (2013) 2, pp. 284-292
Given k identical salesmen, where k⩾2 is a constant independent of the input size, the min–max k-traveling salesmen problem on a tree is to determine a set of k tours for the salesmen to serve all customers that are located on a tree-shaped network, so that each tour starts from and returns...
