Search
Now showing items 1-1 of 1
Spotting difficult weakly correlated binary knapsack problems
(2010-04-16)
We examine in this paper that the possibility of quickly deciding whether or not an instance of a binary knapsack problem is difficult for branch and bound algorithms. We first observe that the distribution of the objective ...