There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
Theoretical analysis and implementation in Java of a Branch & Bound for the TSP that exploits the Langrangian relaxation of the 1-Tree to calculate the bounds efficiently.