The Journal of the Operational Research Society, Vol. 52, No. 5 (May, 2001), pp. 567-575 (9 pages) Several preprocessing rules to reduce integer programming problem size are proposed and examined for ...
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