Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization) The text fully develops an algorithmic approach without losing mathematical rigor..Here is a state of art examination on exact and approximate algorithms for a number of important NP-hard problems in
| Title | : | Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization) |
| Author | : | |
| Rating | : | 4.55 (111 Votes) |
| Asin | : | 0471924202 |
| Format Type | : | Paperback |
| Number of Pages | : | 308 Pages |
| Publish Date | : | 0000-00-00 |
| Genre | : |
Editorial : From the Publisher
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.
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.
I was wrong, and I'm delightfully surprised! You really can learn something new everyday! Thanks, Tobi!. Bad. al.) who held Heaviside in such high esteem. The exposition is deep, elegant, even magisterial; at the same time, it's unstintingly precise and clear without becoming boring.
Why add another 5-start review to those already here? Because I believe this book should be back in print and used more in courses, and to these ends I wanted to explain what differentiates it from its competitors (Spivak's "Calculus on Manifolds" and Munkres's "Analysis on Manifolds".)
The approach is resolutely modern and "high-tech" but always very accessible and without arbitrary generalization (no modules over commutative rings here, just real and complex vector spaces). Self-contained and easy to use.. I did not like this book for several reasons. Really enjoyed this book with all the trials and tribulations of their main characters. It seems to jump a bit. Some of these concept
No comments:
Post a Comment