Knapsack Problems: Algorithms and Computer Implementations (Wiley-Interscience Series in Discrete Mathematics and Optimization)

Here is a state of art examination on exact & 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 & change-making. Well known problems that are not usually classified in the knapsack area, including generalized assignment & bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor.Martello, Silvano is the author of 'Knapsack Problems: Algorithms and Computer Implementations (Wiley-Interscience Series in Discrete Mathematics and Optimization)' with ISBN 9780471924203 and ISBN 0471924202.