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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 9,74 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Anybook.com, Lincoln, Regno Unito
Condizione: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:0471924202. Codice articolo 5568939
Quantità: 1 disponibili
Da: dsmbooks, Liverpool, Regno Unito
Paperback. Condizione: Good. Good. book. Codice articolo D7S9-1-M-0471924202-5
Quantità: 1 disponibili