Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization)

4.33 avg rating
( 3 ratings by Goodreads )
 
9780471924203: Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization)
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

Buy New View Book
List Price: US$ 285.00
US$ 199.00

Convert currency

Shipping: US$ 6.00
Within U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Martello, Silvano; Toth, Paolo
Published by John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A. (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
New Hardcover Quantity Available: 1
Seller:
Rose's Books IOBA
(Harwich Port, MA, U.S.A.)
Rating
[?]

Book Description John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A., 1990. Hard Cover. Condition: New. Reprint. Clock & Rose Press, 2018. Reprint. Hard cover, 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. Size: 8vo - over 7¾" - 9¾" tall. Seller Inventory # 012687

More information about this seller | Contact this seller

Buy New
US$ 199.00
Convert currency

Add to Basket

Shipping: US$ 6.00
Within U.S.A.
Destination, rates & speeds

2.

Martello, Silvano; Toth, Paolo
Published by John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A. (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
New Hardcover Quantity Available: 1
Seller:
Rose's Books IOBA
(Harwich Port, MA, U.S.A.)
Rating
[?]

Book Description John Wiley & Sons, Incorporated, Hoboken, NJ, U.S.A., 1990. Hard Cover. Condition: New. Reprint. Clock & Rose Press, 2018. Reprint. Hard cover, 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. Size: 8vo - over 7¾" - 9¾" tall. Seller Inventory # 012688

More information about this seller | Contact this seller

Buy New
US$ 199.00
Convert currency

Add to Basket

Shipping: US$ 6.00
Within U.S.A.
Destination, rates & speeds

3.

Silvano Martello; Paolo Toth
Published by Wiley (1990)
ISBN 10: 0471924202 ISBN 13: 9780471924203
New Softcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description Wiley, 1990. Condition: New. book. Seller Inventory # M0471924202

More information about this seller | Contact this seller

Buy New
US$ 821.58
Convert currency

Add to Basket

Shipping: US$ 3.27
Within U.S.A.
Destination, rates & speeds