Automatic verification of sequential infinite-state processes

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

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