A Branch-and-Bound Algorithm

  • Toàn Phan Huy
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 492)


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.


Problem Instance Search Tree Constraint Propagation Consistency Test Edge Orientation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Toàn Phan Huy
    • 1
  1. 1.Institut für Betriebswirtschaftslehre IIIRheinische Friedrich-Wilhelm-UniversitätBonnGermany

Personalised recommendations