Branch_and_Bound

Branch_and_Bound - Branch and Bound Definitions: Similar to...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Branch and Bound Definitions: Similar to backtracking technique BFS-like search for solutions Uses a search tree E-node Live-node Solution-node Dead-node Requirements Branching: A set of solutions, which is represented by a node, can be partitioned into mutually exclusive sets. Each subset in the partition is represented by a child of the original node. Lower bounding: An algorithm is available for calculating a lower bound on the cost of any solution in a given subset. Searching: Least-cost search (LC) Cost and approximation Each node, X, in the search tree is associated with a cost: C(X)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
C(X) = cost of reaching the current node, X (E- node), from the root + the cost of reaching an answer node from X. C(X) = g(X) + h(X) Get an approximation of C(x), C ^ (x) such that C ^ (x) C(x), and C ^ (x) = C(x) if x is a solution-node. The approximation part of C ^ (x) is h(x)=the cost of reaching a solution-node from X, not known. Least-cost search:
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 09/03/2010.

Page1 / 7

Branch_and_Bound - Branch and Bound Definitions: Similar to...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online