This project is read-only.
This class can solve salesman travel problem using the Christofides heuristic.

It takes a list of point through which the salesman needs to pass.

The class can use the Christofides heuristic to find a path with a cost that is at most 3/2 of the optimal cost.

Last edited May 30, 2014 at 12:47 PM by Phpdevpad, version 2