
Categories  Download eBook: Knapsack Problems: Algorithms and Computer Implementations  
Book Catagory:Data Structures and Algorithms
Here is a state of art examination on exact and approximate algorithms for a number of important NPhard 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 subsetsum and changemaking. 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.
More Data Structures and Algorithms eBooks: Linear Programming: Foundations and Extensions Algorithms and Data Structures With Applications to Graphics and Geometry Matters Computational: Ideas, Algorithms, Source Code Exploring Randomness Ant Colony Optimization  Techniques and Applications Fundamental Data Structures Introduction to Design Analysis of Algorithms Solving NPComplete Problems Think Complexity: Complexity Science and Computational Modeling Traveling Salesman Problem, Theory and Applications Information Theory, Inference and Learning Algorithms RealWorld Applications of Genetic Algorithms New Frontiers in Graph Theory Search Algorithms for Engineering Optimization Data Structures Succinctly, Part 2 
