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
State-space tree
Node
nonpromising
Promising
n-queens problem
Hamiltonian circuit problem
Subset-sum problem
tuple
difficult combinatorial problems
acceptable amount of time
Branch and Bound
feasible solution
optimal solution
A bound on the best value
the value of the best solution
node represents no feasible solution
Assignment problem
best-first branch-and-bound.
Knapsack problem
binary tree constructed
Travleling salesman problem