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.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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.