Sensitivity analysis for knapsack problems: Another negative result
From MaRDI portal
Publication:1304487
DOI10.1016/S0166-218X(99)00053-0zbMATH Open0957.90124MaRDI QIDQ1304487FDOQ1304487
Authors: Gerhard J. Woeginger 
Publication date: 22 September 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Sensitivity analysis of the knapsack problem: a negative result
- Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?
- Adjacency of the 0-1 knapsack problem
- A hard knapsack problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
Cited In (10)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- Sensitivity analysis of a greedy heuristic for knapsack problems
- Bi-dimensional knapsack problems with one soft constraint
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
- Sensitivity analysis of the knapsack problem: a negative result
- On the complexity of calculating sensitivity parameters in Boolean programming problems
- Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
- Sensitivity analysis for knapsack problems: A negative result
- Adjacency of the 0-1 knapsack problem
This page was built for publication: Sensitivity analysis for knapsack problems: Another negative result
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304487)
