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
Think Data Structuresby Allen B. Downey - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
(5128 views)
Algorithms and Data Structuresby Niklaus Wirth - Prentice Hall
The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.
(12498 views)
Algorithms and Complexityby Herbert S. Wilf - AK Peters, Ltd.
An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.
(14565 views)
Purely Functional Data Structuresby Chris Okasaki - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.
(5130 views)