Approximating the stability region for binary mixed-integer programs
From MaRDI portal
Publication:833592
DOI10.1016/J.ORL.2009.04.001zbMATH Open1167.90605OpenAlexW2109462722MaRDI QIDQ833592FDOQ833592
Authors: Fatma Kılınç-Karzan, Alejandro Toriello, S. Ahmed, G. L. Nemhauser, Martin W. P. Savelsbergh 
Publication date: 14 August 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.04.001
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
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Some concepts of stability analysis in combinatorial optimization
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- The value function of an integer program
- On the complexity of postoptimality analysis of \(0/1\) programs
- Calculation of stability radii for combinatorial optimization problems
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
- Three methods for postoptimal analysis in integer linear programming
- Sensitivity Analysis for Branch and Bound Integer Programming
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
Cited In (3)
Uses Software
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)
