Knapsack Problems
By: by Hans Kellerer, Ulrich Pferschy, David Pisinger
Contributors: Pferschy, Ulrich; Pisinger, D. (David)
Publisher: Springer Berlin Heidelberg
Published: 2004
Place of publication: Berlin, Heidelberg
Language: eng
Format: eBook (PDF)
Number of pages: 546
ISBN-13: 9783642073113; 9783540247777
Subjects: Computational complexity; Economics; Operations research
Description: This book provides a full-scale presentation of all methods and techniques available for the solution of the Knapsack problem. This most basic combinatorial optimization problem appears explicitly or as a subproblem in a wide range of optimization models with backgrounds such diverse as cutting and packing, finance, logistics or general integer programming. This monograph spans the range from a comprehensive introduction of classical algorithmic methods to the unified presentation of the most recent and advanced results in this area many of them originating from the authors. The chapters dealing with particular versions and extensions of the Knapsack problem are self-contained to a high degree and provide a valuable source of reference for researchers. Due to its simple structure, the Knapsack problem is an ideal model for introducing solution techniques to students of computer science, mathematics and economics. The first three chapters give an in-depth treatment of several basic techniques, making the book also suitable as underlying literature for courses in combinatorial optimization and approximation.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.
Table of contents: title: Introduction; title: Basic Algorithmic Concepts; title: Advanced Algorithmic Concepts; title: The Subset Sun Problem; title: Exact Solution of the Knapsack Problem; title: Approximation Algorithms for the Knapsack Problem; title: The Bounded Knapsack Problem; title: The Unbounded Knapsack Problem; title: Multidimensional Knapsack Problems; title: Multiple Knapsack Problems; title: The Multiple-Choice Knapsack Problem; title: The Quadratic Knapsack Problem; title: Other Knapsack Problems; title: Stochastic Aspects of Knapsack Problems; title: Some Selected Applications; title: Introduction to NP-Completeness of Knapsack Problems.