Please enable JavaScript.
Coggle requires JavaScript to display documents.
Backtracking, branch and bound - Coggle Diagram
Backtracking
brute force
incremental
search for candidates to solutions
left them when it may not result in a solution
state-space tree
diverse options for each recursive call
leaves
failure point
point where the algorithm can not proceed
a solution for the problem
The node represents no feasible solutions
branch and bound
optimal solution
feasible solution with the best value of the
objective function
cut off a branch
método enumerativo
feasible solution
point that satisties all the constraints
same idea of backtracking
particionamento