|
|||||||||||||||||||||||||||||||||||
|
1 Review
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
5 of 13 people found the following review helpful:
5.0 out of 5 stars
Great book!,
By nee "nee" (USA) - See all my reviews
This review is from: Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization) (Paperback)
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. The text fully develops an algorithmic approach without losing mathematical rigor. Great for Researchers, Professors and Students in Computer Science and Mathematics. .
|
|
Most Helpful First | Newest First
|
|
Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization) by Silvano Martello (Paperback - Nov. 1990)
Used & New from: $365.47
| |
| ||
