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.
Primary LanguageC#