ISBN 10: 0471924202 / ISBN 13: 9780471924203
Usato / Quantità: 0
Copie del libro da altre librerie
Mostra tutte le  copie di questo libro

Libro

Purtroppo questa copia non è più disponibile. Di seguito ti proponiamo una lista di copie simili.

Descrizione:

Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: Here is a state of art examination on exact & 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 & change-making. Well known problems that are not usually classified in the knapsack area, including generalized assignment & bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor. Codice inventario libreria

Su questo libro:

Book ratings provided by Goodreads):
4,33 valutazione media
(3 valutazioni)

Riassunto: 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 "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Dati bibliografici

Condizione libro: New

I migliori risultati di ricerca su AbeBooks

1.

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

Descrizione libro John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A., 1990. Ring-Binder. Condizione libro: 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 libro della libreria 012687

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 175,73
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,14
In U.S.A.
Destinazione, tempi e costi

2.

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

Descrizione libro John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A., 1990. Ring-Binder. Condizione libro: 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 libro della libreria 012688

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 175,73
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,14
In U.S.A.
Destinazione, tempi e costi

3.

Martello, Silvano, Toth, Paolo
Editore: Wiley (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
Nuovi Paperback Quantità: 1
Da
Murray Media
(North Miami Beach, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Wiley, 1990. Paperback. Condizione libro: New. Codice libro della libreria P110471924202

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 306,05
Convertire valuta

Aggiungere al carrello

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