We transform a multiple traveling salesman problem with fixed charges for the assignment of salesmen and with a symmetric cost matrix to a standard symmetric traveling salesman problem.
For the distance matrix of symmetric traveling salesman problems a simple transformation into an equivalent asymmetric one is given. Assignment algorithms yield sharper lowerbounds and less subtours ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback