News
We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...
Jae Sik Lee, Monique Guignard, An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems -- A Parametric Approach, Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback