An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem

Algorithmica, Volume 78, Issue 4, 2017, Pages 1109-1130.

Cited by: 11|Views20
EI

Abstract:

Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known Christofides' algorithm for the TSP, called the Best-of-Many Christofides' algorithm. The algorithm involves sampling a spanning tree from the solution to the standard LP relaxation of the TSP, subject to the condi...More

Code:

Data:

Your rating :
0

 

Tags
Comments