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
Backtracking with Branch and Bound. Solve the problem of two headquarters that have their costs and a cost of change.
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.
Add a description, image, and links to the sedes topic page so that developers can more easily learn about it.
To associate your repository with the sedes topic, visit your repo's landing page and select "manage topics."