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

**The Art of Computer Programming, Volume 4**

by

**Donald E. Knuth**-

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

(

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

(

**6763**views)

**Algorithms**

by

**Ian Craw, John Pulham**-

**University of Aberdeen**

This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.

(

**9391**views)

**Algorithms and Data Structures: With Applications to Graphics and Geometry**

by

**Jurg Nievergelt, Klaus Hinrichs**-

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

(

**2090**views)