Description:
Wiley & Sons, Incorporated, John. Used - Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Stock Photo: Cover May Be Different
Knapsack Problems: Algorithms and Computer Implementations Hardcover - 1990
by Silvano Martello; Paolo Toth
Details
- Title Knapsack Problems: Algorithms and Computer Implementations
- Author Silvano Martello; Paolo Toth
- Binding Hardcover
- Edition Reprint
- Pages 308
- Volumes 1
- Language ENG
- Publisher Wiley, Hoboken, NJ, U.S.A.
- Date 1990
- ISBN 9780471924203 / 0471924202
- Library of Congress subjects Mathematical optimization, Algorithms
- Library of Congress Catalog Number 90-12279
- Dewey Decimal Code 511.8
More Copies for Sale
Stock Photo: Cover May Be Different
Knapsack Problems : Algorithms and Computer Implementations
by Martello, Silvano, Toth, Paolo
- Used
- Condition
- Used - Good
- ISBN 10 / ISBN 13
- 9780471924203 / 0471924202
- Quantity Available
- 1
- Seller
-
Mishawaka, Indiana, United States
- Item Price
-
SGD 163.81FREE shipping to USA
Show Details
Item Price
SGD 163.81
FREE shipping to USA
Stock Photo: Cover May Be Different
Knapsack Problems : Algorithms and Computer Implementations
by Martello, Silvano; Toth, Paolo
- New
- Hardcover
- Condition
- New
- Edition
- Reprint
- Binding
- Hardcover
- ISBN 10 / ISBN 13
- 9780471924203 / 0471924202
- Quantity Available
- 1
- Seller
-
HARWICH PORT, Massachusetts, United States
- Item Price
-
SGD 271.69SGD 8.19 shipping to USA
Show Details
Description:
Hoboken, NJ, U.S.A.: John Wiley & Sons, Incorporated, 1990. 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…
Read More Item Price
SGD 271.69
SGD 8.19
shipping to USA