Knapsack Problems: Algorithms and Computer Implementations

Main
Mathematics
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

你有多喜歡這本書？

文件的質量如何？

下載本書進行質量評估

下載文件的質量如何？

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.

類別:

Mathematics

年:

1990

版本:

Revised

出版商:

John Wiley & Sons

語言:

english

頁數:

306