Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
From MaRDI portal
Publication:995928
DOI10.1007/S10878-005-4105-5zbMATH Open1133.90386OpenAlexW2021247021MaRDI QIDQ995928FDOQ995928
Authors: Mhand Hifi, Hedi Mhalla, Slim Sadfi 
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
Recommendations
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
Cites Work
- An exact algorithm for large multiple knapsack problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for Large Zero-One Knapsack Problems
- Computing Partitions with Applications to the Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Core problems in knapsack algorithms
- A New Algorithm for the 0-1 Knapsack Problem
- An LP-based approach to a two-stage cutting stock 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
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
Cited In (11)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Approximating the stability region for binary mixed-integer programs
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Tolerance analysis for 0-1 knapsack problems
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
- Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
- Sensitivity analysis for knapsack problems: A negative result
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
Uses Software
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995928)
