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.
-
Updated
Jun 6, 2022 - Java
#
lagrangian-relaxation
Here are 2 public repositories matching this topic...
Branch and Bound Algorithm for the 0/1 Knapsack Problem using Lagrangian Relaxation
-
Updated
Dec 27, 2020 - Java
Improve this page
Add a description, image, and links to the lagrangian-relaxation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lagrangian-relaxation topic, visit your repo's landing page and select "manage topics."