In this paper, we study the sensitivity of the optimum of the knapsack problem to the perturbation of the profit of a subset of items. We propose a polynomial heuristic in order to establish both lower and upper bound...In this paper, we study the sensitivity of the optimum of the knapsack problem to the perturbation of the profit of a subset of items. We propose a polynomial heuristic in order to establish both lower and upper bound limits of the sensitivity interval. The aim is to stabilize any given optimal solution obtained by applying any exact algorithm. We then evaluate the effectiveness of the proposed solution procedure on an example and a set of randomly generated problem instances.展开更多
In this paper,we study the sensitivity of the optimum of the knapsack problem to the perturbation of the profit of a subset of items.We propose a polynomial heuristic in order to establish both lower and upper bound l...In this paper,we study the sensitivity of the optimum of the knapsack problem to the perturbation of the profit of a subset of items.We propose a polynomial heuristic in order to establish both lower and upper bound limits of the sensitivity interval.The aim is to stabilize any given optimal solution obtained by applying any exact algorithm.We then evaluate the effectiveness of the proposed solution procedure on an example and a set of randomly generated problem instances.展开更多
文摘In this paper, we study the sensitivity of the optimum of the knapsack problem to the perturbation of the profit of a subset of items. We propose a polynomial heuristic in order to establish both lower and upper bound limits of the sensitivity interval. The aim is to stabilize any given optimal solution obtained by applying any exact algorithm. We then evaluate the effectiveness of the proposed solution procedure on an example and a set of randomly generated problem instances.
文摘In this paper,we study the sensitivity of the optimum of the knapsack problem to the perturbation of the profit of a subset of items.We propose a polynomial heuristic in order to establish both lower and upper bound limits of the sensitivity interval.The aim is to stabilize any given optimal solution obtained by applying any exact algorithm.We then evaluate the effectiveness of the proposed solution procedure on an example and a set of randomly generated problem instances.
