Opening the shelf…
Book dossier
by Gerhard Rubow
No description is available for this edition yet.
Branch-and-bound strategies for dynamic programming
Thomas L. Morin
Automatic verification of sequential infinite-state processes
Olaf Burkart
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program
Jay Culliney
Pruning and branching methods for designing optimal networks by the branch-and-bound method
Tomoyasu Nakagawa
Branch and bound methods for combinatorial problems
John D. C. Little
Optimizing binary trees grown with a sorting algorithm
William A Martin
Scheduling the hybrid flowshop
Omar Moursli
Manipulating the branch and bound tree
Fred Glover
Efficient branch and bound search with application to computer-aided design
Xinghao Chen