News
This is a preview. Log in through your library . Abstract Several types of large-sized 0-1 Knapsack Problems (KP) may be easily solved, but in such cases most of the computational effort is used for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results