Logo

Knapsack Problems: Algorithms and Computer Implementations

Small book cover: Knapsack Problems: Algorithms and Computer Implementations

Knapsack Problems: Algorithms and Computer Implementations
by

Publisher: John Wiley & Sons
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.

Home page url

Download or read it online for free here:
Download link
(23MB, PDF)

Similar books

Book cover: Vector Models for Data-Parallel ComputingVector Models for Data-Parallel Computing
by - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(8767 views)
Book cover: The Art of Computer Programming, Volume 4The Art of Computer Programming, Volume 4
by - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
(21603 views)
Book cover: Algorithms and Data Structures: With Applications to Graphics and GeometryAlgorithms and Data Structures: With Applications to Graphics and Geometry
by - Prentice Hall
Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.
(5552 views)
Book cover: LEDA: A Platform for Combinatorial and Geometric ComputingLEDA: A Platform for Combinatorial and Geometric Computing
by - 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.
(6990 views)