Abstract: This work deals with the 0-1 knapsack problem in its two-dimensional variant, when there is a conflict graph related to pairs of conflicting items. Conflicting items must not be packed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results