
Efficient Branch and Bound Search with Application to Computer-Aided Design
In many applications, the classic branch-and-bound search methods perform duplications of computations, or rely on the search decision trees which keep track of the branch-and-bound search processes.
- Kirjailija
- Xinghao Chen, Michael L. Bushnell
- Painos
- Softcover reprint of the original 1st ed. 1996
- ISBN
- 9781461285717
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 26.9.2011
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 146