Approximating the stability region for binary mixed-integer programs
From MaRDI portal
Recommendations
- Stability of mixed-integer quadratic programming problems
- Calculation of stability radii for combinatorial optimization problems
- scientific article; zbMATH DE number 3936922
- scientific article; zbMATH DE number 2159165
- The analysis of the stability of some integer programming algorithms with respect to the objective function
Cites work
- Calculation of stability radii for combinatorial optimization problems
- On the complexity of postoptimality analysis of 0/1 programs
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
- Sensitivity Analysis for Branch and Bound Integer Programming
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Some concepts of stability analysis in combinatorial optimization
- The value function of an integer program
- Three methods for postoptimal analysis in integer linear programming
Cited in
(3)
This page was built for publication: Approximating the stability region for binary mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833592)