Computer Tutorials and Books
Tutorials: C / C++ | C#.NET | PHP MySQL | Java | Java Script | jQuery | HTML | xHTML | HTML5 | VB Script | CSS

Books: C/C++ | C# | Android | Mathematics | Database | Cloud | Graphics | Networking | Oracle | Hardware | AI
Categories Download eBook: Knapsack Problems: Algorithms and Computer Implementations Bookmark and Share

Title Knapsack Problems: Algorithms and Computer Implementations
Author(s) Silvano Martello, Paolo Toth
Publisher: John Wiley & Sons; 1 edition (November 1990)
Hardcover/Paperback 308 pages
Language: English
ISBN-10/ASIN: 0471924202
ISBN-13: 978-0471924203
Book 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. 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.
Download eBook
Knapsack Problems: Algorithms and Computer Implementations

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 NP-Complete Problems
Think Complexity: Complexity Science and Computational Modeling
Traveling Salesman Problem, Theory and Applications
Information Theory, Inference and Learning Algorithms
Real-World Applications of Genetic Algorithms
New Frontiers in Graph Theory
Search Algorithms for Engineering Optimization
Data Structures Succinctly, Part 2

Home - Advertise - Contact - Disclaimer - About Us
© Since 2006 -- All Rights Reserved.