Project for the master's degree combinatorial optimization exam. 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.
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.
License
LorenzoSciandra/Branch-and-BoundTSP
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published