1. Preface

   • Toshihide Ibaraki

   EditorialNotes Pages: VII - IX

2. Chapter 6 Dynamic programming algorithms

   OriginalPaper Pages: 343 - 395

3. Chapter 7 Successive sublimation methods for dynamic programming computation

   OriginalPaper Pages: 397 - 439

4. Chapter 8 Design and analysis of approximate algorithms

   OriginalPaper Pages: 441 - 510

5. Chapter 9 Implementation and concurrent execution of branch-and-bound algorithms

   OriginalPaper Pages: 511 - 559

6. References

   Legacy Pages: 561 - 583