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 ...
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback