Skip to content

Knapsack Problems

Best in textbook rentals since 2012!

ISBN-10: 3540402861

ISBN-13: 9783540402862

Edition: 2004

Authors: Hans Kellerer, Ulrich Pferschy, David Pisinger

List price: $279.99
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

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…    
Customers also bought

Book details

List price: $279.99
Copyright year: 2004
Publisher: Springer Berlin / Heidelberg
Publication date: 12/15/2003
Binding: Hardcover
Pages: 548
Size: 6.14" wide x 9.21" long x 1.25" tall
Weight: 4.730
Language: English

Preface
Table of Contents
List of Notations
Introduction
Basic Algorithmic Concepts
Advanced Algorithmic Concepts
The Subset Sum 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
References
Author Index
Subject Index