Knapsack Problems: Algorithms and Computer Implementations by Silvano Martello
English | 22 Aug. 1990 | ISBN: 0471924202 | 306 Pages | PDF | 10 MB
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 NP-hard problems.