lasaldan/tsp_cs312

An attempt at an efficient algorithm for solving the Traveling Salesman problem. Uses Branch and Bound with a heap-based priority queue. Has probing to periodically run a possible solution to a solution state. Occasionally performs well.

Private Group Project - TSP - CS312 Winter 2015

Collaborators:

• Michael Free (free2bcreative@gmail.com)
• Daniel Fuller (lasaldan@gmail.com)

Project Spec at: http://wiki.cs.byu.edu/cs-312/project-7