Approximation for optimum value of Travelling Salesman Problem using by Christofides Algorithm. The algorithm is designed for input size range from 1k to 30k. The algorithm can come up with an approximation within 15% range of the true optimim value.
ahmetlekesiz / tsp-approximation Goto Github PK
View Code? Open in Web Editor NEWTraveling Salesman Problem Approximation Christofides Algorithm