 An adaptive algorithm for the knapsack problem: perturbation of the profit or weight of an arbitrary itemMhand Hifi, Hedi Mhalla and Slim Sadfi European Journal of Industrial Engineering, 2008, vol. 2, issue 2, 134-152 Abstract: 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 picks a subset of these items with maximal total profit while obeying the constraint that the maximum total weight of the chosen items does not exceed c. This paper proposes an adaptive branch and bound tree search algorithm that exactly solves the problem, and provides the limits of the sensitivity intervals, which guarantee the stability of the optimal solution when the profit of any arbitrary item is perturbed. Next, the paper adapts the exact algorithm for the perturbation of the weight coefficient of an arbitrary item. The computational results demonstrate the effectiveness of the adaptive algorithm. [Received: 16 March 2007; Revised: 08 August 2007; Accepted: 16 November 2007] Keywords: adaptive algorithm; combinatorial optimisation; knapsack problem; optimality; sensitivity analysis; profit; weight; arbitrary items. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:2:y:2008:i:2:p:134-152 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.