Na, Byungsoo (Texas A&M University, 2007-09-17)
This thesis deals with the no-depot minmax Multiple Traveling Salesmen Problem
(MTSP), which can be formulated as follows. Given a set of n cities and k salesmen,find k disjoint tours (one for each salesmen) such that each ...