1. Preface

   • Toshihide Ibaraki

   EditorialNotes Pages: v - vii

2. Chapter 1 combinatorial optimization problems and their complexity

   ReviewPaper Pages: 1 - 49

3. Chapter 2 branch-and-bound algorithms

   ReviewPaper Pages: 51 - 116

4. Chapter 3 branch-and-bound algorithms for typical combinatorial optimization problems

   ReviewPaper Pages: 117 - 223

5. Chapter 4 performance characterization of branch-and-bound algorithms

   ReviewPaper Pages: 225 - 282

6. Chapter 5 theoretical evaluation of branch-and-bound computation

   ReviewPaper Pages: 283 - 342