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

- **Canonical URL**: https://githubrepo.cloud/repo/lasaldan/tsp_cs312
- **GitHub Repository**: https://github.com/lasaldan/tsp_cs312
- **Maintainer / Creator**: https://github.com/lasaldan
- **Discovered On**: Oct 6, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*