Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem

DOI10.1007/s10878-005-4105-5zbMath1133.90386OpenAlexW2021247021MaRDI QIDQ995928

Mhand Hifi, Slim Sadfi, Hedi Mhalla

Publication date: 10 September 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-4105-5

zbMATH Keywords

sensitivity analysiscombinatorial optimizationoptimalityknapsacks

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (9)

Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study ⋮ Approximating the stability region for binary mixed-integer programs ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study

Uses Software

• Knapsack
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for large multiple knapsack problems
• An LP-based approach to a two-stage cutting stock problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• A genetic algorithm for the multidimensional knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Core Problems in Knapsack Algorithms
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• Computing Partitions with Applications to the Knapsack Problem
• Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
• Exact algorithms for large-scale unconstrained two and three staged cutting problems

This page was built for publication: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem