Sensitivity analysis for knapsack problems: A negative result
From MaRDI portal
Publication:1382258
DOI10.1016/S0166-218X(97)00080-2zbMath0895.90155MaRDI QIDQ1382258
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
90C31: Sensitivity, stability, parametric optimization
90C27: Combinatorial optimization
90C09: Boolean programming
Related Items
Sensitivity analysis for knapsack problems: Another negative result, Sensitivity analysis for knapsack problems: A 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