1997
Calculation of Stability Radii for Combinatorial Optimization Problems
Publication
Publication
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.
Additional Metadata | |
---|---|
, , , , , | |
hdl.handle.net/1765/1403 | |
Econometric Institute Research Papers | |
Organisation | Erasmus School of Economics |
Chakravarti, N., & Wagelmans, A. (1997). Calculation of Stability Radii for Combinatorial Optimization Problems (No. EI 9740/A). Econometric Institute Research Papers. Retrieved from http://hdl.handle.net/1765/1403 |