Backtracking with Branch and Bound. Solve the problem of two headquarters that have their costs and a cost of change.
-
Updated
Nov 3, 2018 - Java
#
sedes
Here are 4 public repositories matching this topic...
Two greedy algorithms to the problem of choose a headquarters of two , each headquarters had their costs and a cost of changed of headquarters. One algorithm have a selection function with the cost of change an the other without that cost.
-
Updated
Dec 11, 2018 - Java
-
Updated
May 7, 2026 - Python
Add this topic to your repo
To associate your repository with the sedes topic, visit your repo's landing page and select "manage topics."