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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback