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: Combinatorial AlgorithmsCombinatorial Algorithms
by - Academic Press Inc
This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.
(18976 views)
Book cover: AlgorithmsAlgorithms
by - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(12805 views)
Book cover: Problem Solving with Algorithms and Data Structures Using PythonProblem Solving with Algorithms and Data Structures Using Python
by - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(17804 views)
Book cover: Algorithmic MathematicsAlgorithmic Mathematics
by - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.
(23959 views)