KOTA, LÁSZLÓ; JÁRMAI, KÁROLY - In: Polish Journal of Management Studies 7 (2013) 2, pp. 95-102
The fixed destination MmTSP (multi-depot multiple travelling salesman problem) is an np hard problem, which can’t be solved in polynomial time. Against the traditional TSP problem here there are more travelling salesmen which seek out the cities. Every city is visited by once by any of the...