exact-tsp-solver
A dual-mode solver for the Traveling Salesman Problem written in Go, featuring exact Branch & Bound with proven optimality and heuristic threshold search with reference gap.
- 4
- Go
- BSD-3-Clause
- 2 mo ago
A dual-mode solver for the Traveling Salesman Problem written in Go, featuring exact Branch & Bound with proven optimality and heuristic threshold search with reference gap.
A high-performance, exact solver for the Traveling Salesman Problem (TSP) implemented in Python. Utilizes an intelligent Branch and Bound algorithm with adaptive thresholding to find the globally optimal solution for small to medium-sized TSP instances.