Knapsack problems : algorithms and computer implementations / Silvano Martello and Paolo Toth.
By: Martello, Silvano
.
Contributor(s): Toth, Paolo.
Material type: 
BookSeries: Wiley-Interscience series in discrete mathematics and optimization.Publisher: Chichester ; New York : J. Wiley & Sons, c1990Description: xii, 296 p. : ill. ; 25 cm.ISBN: 0471924202.Subject(s): Computational complexity | Mathematical optimization | Algorithms | Linear programming | Integer programmingDDC classification: 519.72 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 519.72 (Browse shelf(Opens below)) | 1 | Available | 00025883 |
Enhanced descriptions from Syndetics:
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. Well known problems that are not usually classified in the knapsack area, including generalized assignment and bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor.
Bibliography: (pages 275-282) and indexes.
Introduction -- 0-1 Knapsack problem -- Bounded knapsack problem -- Subset-sun problem -- Change-making problem -- 0-1 Multiple knapsack problem -- Generalized assignment problem -- Bin-packing problem.