Sensitivity analysis for knapsack problems: A negative result

DOI10.1016/S0166-218X(97)00080-2zbMath0895.90155OpenAlexW2110628946MaRDI QIDQ1382258

D. Massart

Publication date: 25 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

sensitivity analysisknapsack problems

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

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, Bi-dimensional knapsack problems with one soft constraint, Sensitivity analysis for knapsack problems: A negative result, 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, Exact solution approach for a class of nonlinear bilevel knapsack problems, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Sensitivity analysis for knapsack problems: Another negative result

Cites Work

• Unnamed Item
• Aggregation of nonnegative integer-valued equations
• On the reduction method for integer linear programs. II
• A new reduction method in integer programming
• Sequential and simultaneous aggregation of diophantine equations
• Sensitivity analysis for knapsack problems: A negative result
• New results for aggregating integer-valued equations
• Transformation of integer programs to knapsack problems
• New results on equivalent integer programming formulations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach