Knapsack Problems: Algorithms and Computer Implementations

Main
Mathematics - Optimization. Operations Research
Knapsack Problems: Algorithms and...

Knapsack Problems: Algorithms and Computer Implementations

Name: Knapsack Problems: Algorithms and Computer Implementations
ISBN: 9780471924203

Silvano Martello, Paolo Toth

0 / 0

0 comments

How much do you like this book?

What’s the quality of the file?

Download the book for quality assessment

What’s the quality of the downloaded files?

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. Well known problems that are not usually classified in the knapsack area, including generalized assignment and bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor.

Categories:

Mathematics - Optimization. Operations Research

Content Type:

Books

Year:

1990

Edition:

Revised

Publisher:

John Wiley & Sons

Language:

english