Calculation of stability radii for combinatorial optimization problems

Authors:
Nilotpal Chakravarti;Albert P. M. Wagelmans
Affiliations:
Indian Institute of Management, Joka, P.O. Alipore, P.O. Box 16757, Calcutta 700027, India;Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, Netherlands
Venue:
Operations Research Letters
Year:
1998

Citing 4
Cited 7

Some concepts of stability analysis in combinatorial optimization

Proceedings of the workshop on Discrete algorithms
On the complexity of postoptimality analysis of 0/1 programs

Discrete Applied Mathematics
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution

Journal of the ACM (JACM)

Sensitivity Analysis for Scheduling Problems

Journal of Scheduling
Stability Analysis of Some Discrete Optimization Algorithms

Automation and Remote Control
Integer Programming: Optimization and Evaluation Are Equivalent

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A note on robustness tolerances for combinatorial optimization problems

Information Processing Letters
On the stability of some integer programming algorithms

Operations Research Letters
Approximating the stability region for binary mixed-integer programs

Operations Research Letters
Quantitative stability analysis for vector problems of 0-1 programming

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to the tolerance approach to sensitivity analysis.