2004

Knapsack Problems

ISBN: 978-3-642-07311-3 (Print) 978-3-540-24777-7 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages I-XX

  2. No Access

    Book Chapter

    Pages 1-14

    Introduction

  3. No Access

    Book Chapter

    Pages 15-42

    Basic Algorithmic Concepts

  4. No Access

    Book Chapter

    Pages 43-72

    Advanced Algorithmic Concepts

  5. No Access

    Book Chapter

    Pages 73-115

    The Subset Sum Problem

  6. No Access

    Book Chapter

    Pages 117-160

    Exact Solution of the Knapsack Problem

  7. No Access

    Book Chapter

    Pages 161-183

    Approximation Algorithms for the Knapsack Problem

  8. No Access

    Book Chapter

    Pages 185-209

    The Bounded Knapsack Problem

  9. No Access

    Book Chapter

    Pages 211-234

    The Unbounded Knapsack Problem

  10. No Access

    Book Chapter

    Pages 235-283

    Multidimensional Knapsack Problems

  11. No Access

    Book Chapter

    Pages 285-316

    Multiple Knapsack Problems

  12. No Access

    Book Chapter

    Pages 317-347

    The Multiple-Choice Knapsack Problem

  13. No Access

    Book Chapter

    Pages 349-388

    The Quadratic Knapsack Problem

  14. No Access

    Book Chapter

    Pages 389-424

    Other Knapsack Problems

  15. No Access

    Book Chapter

    Pages 425-447

    Stochastic Aspects of Knapsack Problems

  16. No Access

    Book Chapter

    Pages 449-482

    Some Selected Applications

  17. No Access

    Book Chapter

    Pages 483-493

    Introduction to NP-Completeness of Knapsack Problems

  18. Back Matter

    Pages 495-546