Model as a Mixed Integer Programming Problem the following Many Trav- eling Salesmen Problem related to vehicle routing problems in distribution management: a company must send all its N representatives to visit each and every city in a network of cities connected by roads (arcs) and have each representative return to the company headquarters in such a way that no city is visited twice by any representative, all representatives start from the same headquarters and return to them, and the total cost of the representatives’ tours measured by the sum of the distances they travel is minimized.