In this paper, an efficient algorithm based on the Pascoletti-Serafini scalarization (PS) approach is proposed to obtain almost uniform approximations of the entire Pareto front of bi-objective ...
The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...
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