
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.
- Författare
- Xinghao Chen, Michael L. Bushnell
- Upplaga
- Softcover reprint of the original 1st ed. 1996
- ISBN
- 9781461285717
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 26.9.2011
- Sidor
- 146