Pruning and branching methods for designing optimal networks by the branch-and-bound method

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

Branch and bound methods for combinatorial problems

John D. C. Little

Optimizing binary trees grown with a sorting algorithm

William A Martin

Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus

Gerhard Rubow

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