Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
From MaRDI portal
Publication:4530656
Recommendations
- Inference duality as a basis for sensitivity analysis
- POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
- Sensitivity Analysis for Branch and Bound Integer Programming
- Sensitivity analysis of mixed integer programs: An application to environmental policy making
- Non-linear integer programming: Sensitivity analysis for branch and bound
Cited in
(14)
- A note on the linear programming sensitivity analysis of specification constraints in blending problems
- Marginal values in mixed integer linear programming
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Compact representation of near-optimal integer programming solutions
- Challenges in Enterprise Wide Optimization for the Process Industries
- Title not available (Why is no real title available?)
- Optimization Bounds from the Branching Dual
- Superadditive characterizations of pure integer programming feasibility
- Sensitivity Analysis for Branch and Bound Integer Programming
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- Sensitivity analysis of mixed integer programs: An application to environmental policy making
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Scheduling a two-stage flowshop under makespan constraint
- Benders' cuts guided large neighborhood search for the traveling umpire problem
This page was built for publication: Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530656)