Algorithm for multiple travelling salemens problem with given starting point and end point

Question

Please feel free to edit/rename the question...

Here\'s the problem:

 Given:
 - Set of n (n > 0) cities is to be traversed by m (m > 0) salesmens