Knapsack Problems: Algorithms and Computer Implementations
by Silvano Martello, Paolo Toth
Publisher: John Wiley & Sons 1990
ISBN/ASIN: 0471924202
ISBN-13: 9780471924203
Number of pages: 308
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.
Download or read it online for free here:
Download link
(23MB, PDF)
Similar books
Lecture Notes on Bucket Algorithms
by Luc Devroye - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(11338 views)
by Luc Devroye - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(11338 views)
LEDA: A Platform for Combinatorial and Geometric Computing
by K. Mehlhorn, St. Näher - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
(9741 views)
by K. Mehlhorn, St. Näher - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
(9741 views)
Computational Geometry: Methods and Applications
by Jianer Chen
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
(16120 views)
by Jianer Chen
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
(16120 views)
Data Structures and Algorithms: Annotated Reference with Examples
by Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(18642 views)
by Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(18642 views)