Articoli correlati a Knapsack Problems: Algorithms and Computer Implementations

Knapsack Problems: Algorithms and Computer Implementations

Valutazione media 4,25
( su 4 valutazioni fornite da Goodreads )
 
9780471924203: Knapsack Problems: Algorithms and Computer Implementations
Vedi tutte le copie di questo ISBN:
 
 

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.

I migliori risultati di ricerca su AbeBooks

Foto dell'editore

Martello, Silvano; Toth, Paolo
Editore: John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A. (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
Nuovo Rilegato Quantità: 1
Da
Rose's Books IOBA
(Harwich Port, MA, U.S.A.)
Valutazione libreria

Descrizione libro Ring-Binder. Condizione: New. Reprint. Reprint. Very sturdy ring-bound book with stiff covers, 308 pp. Includes diskette with implementations. This book presents a state-of-the-art (as of 1990) on exact and approximate algorithms for a number of important NP-hard problems in the field of linear programming which are grouped under the term "knapsack". The reader will find not only the "classical" knapsack problems (binary, bounded, unbounded, binary multiple), but also less familiar problems (subset-sum, change-making) or well-known problems (fractional, multidimensional, non-linear) and only a limited treatment of the case of generalized upper bound constraints. For each problem, the authors give a mathematical model, discussing its relaxations and deriving procedures for the computation of bounds. They then develop approximate algorithms, approximination schemes, dynamic programming techniques and brand-and-bound algorithms. They analyze the computational complexity and the worst-case performance of bounds and approximate methods. The average performance of the computer implementations of exact and approximate algorithms is finally examined through extensive computational experiments. The Fortran codes implementing the most effective methods are provided in the included diskette. New book and CD. Codice articolo 012688

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 180,92
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,30
In U.S.A.
Destinazione, tempi e costi
Foto dell'editore

Martello, Silvano; Toth, Paolo
Editore: John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A. (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
Nuovo Rilegato Quantità: 1
Da
Rose's Books IOBA
(Harwich Port, MA, U.S.A.)
Valutazione libreria

Descrizione libro Ring-Binder. Condizione: New. Reprint. Reprint. Very sturdy ring-bound book with stiff covers, 308 pp. Includes diskette with implementations. This book presents a state-of-the-art (as of 1990) on exact and approximate algorithms for a number of important NP-hard problems in the field of linear programming which are grouped under the term "knapsack". The reader will find not only the "classical" knapsack problems (binary, bounded, unbounded, binary multiple), but also less familiar problems (subset-sum, change-making) or well-known problems (fractional, multidimensional, non-linear) and only a limited treatment of the case of generalized upper bound constraints. For each problem, the authors give a mathematical model, discussing its relaxations and deriving procedures for the computation of bounds. They then develop approximate algorithms, approximination schemes, dynamic programming techniques and brand-and-bound algorithms. They analyze the computational complexity and the worst-case performance of bounds and approximate methods. The average performance of the computer implementations of exact and approximate algorithms is finally examined through extensive computational experiments. The Fortran codes implementing the most effective methods are provided in the included diskette. New book and CD. Codice articolo 012687

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 180,92
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,30
In U.S.A.
Destinazione, tempi e costi
Foto dell'editore

Martello, Silvano; Toth, Paolo
Editore: Wiley (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
Nuovo Brossura Quantità: 1
Da
Big Bill's Books
(Austin, TX, U.S.A.)
Valutazione libreria

Descrizione libro Condizione: new. Codice articolo BBB_newH_0471924202

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 207,37
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 2,65
In U.S.A.
Destinazione, tempi e costi