Cover Image

Knapsack Problems /

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Kellerer, Hans
Corporate Author: SpringerLink (Online service)
Other Authors: Pferschy, Ulrich, Pisinger, D. (David)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
Subjects:
Economics.
Computational complexity.
Operations research.
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • Introduction
  • Basic Algorithmic Concepts
  • Advanced Algorithmic Concepts
  • The Subset Sun Problem
  • Exact Solution of the Knapsack Problem
  • Approximation Algorithms for the Knapsack Problem
  • The Bounded Knapsack Problem
  • The Unbounded Knapsack Problem
  • Multidimensional Knapsack Problems
  • Multiple Knapsack Problems
  • The Multiple-Choice Knapsack Problem
  • The Quadratic Knapsack Problem
  • Other Knapsack Problems
  • Stochastic Aspects of Knapsack Problems
  • Some Selected Applications
  • Introduction to NP-Completeness of Knapsack Problems.