An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
From MaRDI portal
Publication:1600931
DOI10.1016/S0377-2217(01)00162-XzbMath1003.90028MaRDI QIDQ1600931
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
parametric programmingnon-parametric 0-1-mixed integer linear programmingparametric 0-1-integer linear programming
Integer programming (90C10) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)
Uses Software
Cites Work
- Parametric-objective integer programming using knapsack facets and Gomory cutting planes
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- Advances in sensitivity analysis and parametric programming
- Parametric methods in integer linear programming
- Three methods for postoptimal analysis in integer linear programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
- Parametric Mixed Integer Programming: An Application to Solid Waste Management
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program