Knapsack Problems: Algorithms and Computer Implementations

Knapsack Problems: Algorithms and Computer Implementations
by Silvano Martello, Paolo Toth

Publisher: John Wiley & Sons 1990
ISBN/ASIN: 0471924202
ISBN-13: 9780471924203
Number of pages: 308

Description:
Here is a state of art examination on exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which the authors refer to as "knapsack". Includes not only the classical knapsack problems such as binary, bounded, unbounded or binary multiple, but also less familiar problems such as subset-sum and change-making.