Hifi, Mhand; Mhalla, Hedi; Sadfi, Slim - In: European Journal of Industrial Engineering 2 (2008) 2, pp. 134-152
This paper solves the binary single-constrained Knapsack Problem (KP) and undertakes a sensitivity analysis of its optimum solution. Given a knapsack of capacity c, and a set of n items, with each item j, j = 1,?,n, characterised by a weight wj and a profit pj, the binary single-constrained KP...