Celebrate our new site and save $15 Get code »

Knapsack Problems: Algorithms and Computer Implementations

by ,

Write The First Customer Review
Image not available

The development of computational complexity theory has led, in the last 15 years, to insights into the inherent difficulty of combinatorial optimization problems, but has also produced an undesirable side effect which can be summarized by the equation NP-hardness = intractability, thereby diminishing attention to the study of exact algorithms for ... Read More

Knapsack Problems: Algorithms and Computer Implementations 1990, John Wiley & Sons, Chichester, England

ISBN-13: 9780471924203

Hardcover

Select