**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

**Data Structures and Algorithms**

by

**Catherine Leung**-

**GitBook**

This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.

(

**3660**views)

**Average Case Analysis of Algorithms on Sequences**

by

**Wojciech Szpankowski**-

**Wiley-Interscience**

A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.

(

**7879**views)

**Problems on Algorithms, 2nd edition**

by

**Ian Parberry, William Gasarch**-

**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.

(

**12428**views)

**A Practical Introduction to Data Structures and Algorithm Analysis**

by

**Clifford A. Shaffer**-

**Virginia Tech**

A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.

(

**8619**views)