Sensitivity Analysis for Branch and Bound Integer Programming
From MaRDI portal
Recommendations
- Non-linear integer programming: Sensitivity analysis for branch and bound
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- Sensitivity analysis of mixed integer programs: An application to environmental policy making
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
Cited in
(22)- Parametric methods in integer linear programming
- Approximating the stability region for binary mixed-integer programs
- Non-linear integer programming: Sensitivity analysis for branch and bound
- Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Compact representation of near-optimal integer programming solutions
- scientific article; zbMATH DE number 6419199 (Why is no real title available?)
- Evaluating mixed-integer programming models over multiple right-hand sides
- Challenges in Enterprise Wide Optimization for the Process Industries
- scientific article; zbMATH DE number 764459 (Why is no real title available?)
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- Real-time personnel re-scheduling after a minor disruption in the retail industry
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- Postoptimal Analysis in Nonserial Dynamic Programming
- Sensitivity analysis of mixed integer programs: An application to environmental policy making
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
This page was built for publication: Sensitivity Analysis for Branch and Bound Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706845)