Sensitivity analysis for knapsack problems: Another negative result
From MaRDI portal
Publication:1304487
DOI10.1016/S0166-218X(99)00053-0zbMath0957.90124MaRDI QIDQ1304487
Publication date: 22 September 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)
Related Items (6)
Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ On the complexity of calculating sensitivity parameters in Boolean programming problems ⋮ Sensitivity analysis of the knapsack problem: a negative result ⋮ Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
Cites Work
This page was built for publication: Sensitivity analysis for knapsack problems: Another negative result
