Please enable JavaScript.
Coggle requires JavaScript to display documents.
Coping with the Limitations of Algorithm Power - Coggle Diagram
Coping with the Limitations of Algorithm Power
Backtracking
Backtracking is a more intelligent variation of this approach.
The principal idea is to construct solutions one component at a time and evaluate such partially constructed candidates as follows.
state-space tree
promising
nonpromising
n-Queens Problem
Hamiltonian Circuit Problem
Subset-Sum Problem
General Remarks
branch-and-bound
feasible solution
is a point in the problem’s search space that satisfies all the problem’s constraints
optimal solution
is a feasible solution with the best value of the
objective function
Assignment Problem
live
best-first branch-and-bound
Knapsack Problem
Traveling Salesman Problem