The Multiple Traveling Salesman Problem (MTSP) is a canonical combinatorial optimisation challenge in which a fleet of salespeople must collectively visit a set of locations and return to a common ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results