Slowly, Step by Step

Branch and Bound Similar to “Backtracking” - a state-space tree is used to solve a problem (pruning tree 사용한다) Different from “Backtracking” - does not limit us to any particular way of traversing a tree (탐색하는데에, 방법제한이 없다.) (backtrack에서는 recursion기반의 dfs가 중점적이다) - is used only for optimization problems (bound값을 사용해야해서, 최적문제들만 사용가능함) Step 1 computes a number (bound) at a node to determine whether..

Backtracking greedy처럼 일련의 집합을 만들어 하나씩 답에 만족시키는 것을 만든다. greedy와 다르게, 조건에 맞지 않는다면 번복할 수 있다. 되돌아갈 수 있다. - used to solve problems in which a sequence of objects is chosen from a specified set so that the sequence satisfies some criterion. - after each choice has been made and added to a partial solution, it can be retracted from the solution set later by backtracking 5.1 The Backtracking Technique N..