In the multidimensional 0-1 knapsack problem, we are given a set of items, each with a value and multiple attributes, and we want to select a subset in such a way that the total value is maximized ...
Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar., 1988), pp. 402-410 (9 pages) A new approximate algorithm for multidimensional zero-one knapsack problems with all positive ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback