Average time per problem was less than a second, and the maximum time for any single problem was 3 seconds. Value-independent 0-1 knapsack problems (also randomly generated), were solved with a ...

M. Hifi, M. Michrafy, A Reactive Local Search-Based Algorithm for the Disjunctively Constrained Knapsack Problem, The Journal of the Operational Research Society, Vol. 57, No. 6 (Jun., 2006), pp.