Approximating the stability region for binary mixed-integer programs

DOI10.1016/j.orl.2009.04.001zbMath1167.90605OpenAlexW2109462722MaRDI QIDQ833592

Fatma Kılınç-Karzan, Alejandro Toriello, Shabbir Ahmed, Savelsbergh, Martin W. P., Nemhauser, George I.

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

zbMATH Keywords

stability analysissensitivity analysisreal-time optimizationbinary integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (3)

Compact representation of near-optimal integer programming solutions ⋮ Balancing of simple assembly lines under variations of task processing times ⋮ A Gilmore-Gomory construction of integer programming value functions

Uses Software

• MIPLIB

Cites Work

• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
• On the complexity of postoptimality analysis of \(0/1\) programs
• Calculation of stability radii for combinatorial optimization problems
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Some concepts of stability analysis in combinatorial optimization
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Three methods for postoptimal analysis in integer linear programming
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
• Sensitivity Analysis for Branch and Bound Integer Programming
• The value function of an integer program

This page was built for publication: Approximating the stability region for binary mixed-integer programs