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: A=BA=B
by - AK Peters, Ltd.
The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.
(21572 views)
Book cover: Problems on Algorithms, 2nd editionProblems on Algorithms, 2nd edition
by - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(14186 views)
Book cover: Design and Analysis of Computer AlgorithmsDesign and Analysis of Computer Algorithms
by - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(14292 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(11935 views)