Benchmarking Framework - Professional-grade testing infrastructure with configurable scenarios and detailed metrics
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.
A high-performance Python library for solving the Traveling Salesman Problem (TSP) using novel heuristics. Sometimes outperforms classical methods by **~25%** on real and clustered data by using spatial intelligence and adaptive strategies.
Add a description, image, and links to the tsp-solver-python topic page so that developers can more easily learn about it.
To associate your repository with the tsp-solver-python topic, visit your repo's landing page and select "manage topics."