A Branch-and-Bound Algorithm
- 82 Downloads
In this chapter, we describe a branch-and-bound algorithm for the DSP in which to embed the constraint propagation techniques that we have derived in the last chapter. A general introduction to branch-and-bound has been given in section 2.3. As mentioned there, one of the most important components of a branch-and-bound solution method is a branching scheme which specifies how to decompose the search space into smaller subspaces that are hopefully easier to explore.
KeywordsProblem Instance Search Tree Constraint Propagation Consistency Test Edge Orientation
Unable to display preview. Download preview PDF.