1998-08-01
Calculation of stability radii for combinatorial optimization problems
Publication
Publication
Operations Research Letters p. 1- 7
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 | |
|---|---|
| , , , , , | |
| doi.org/10.1016/S0167-6377(98)00031-5, hdl.handle.net/1765/14443 | |
| ERIM Article Series (EAS) | |
| Operations Research Letters | |
| Organisation | Erasmus Research Institute of Management |
|
Chakravarti, N., & Wagelmans, A. (1998). Calculation of stability radii for combinatorial optimization problems. Operations Research Letters, 1–7. doi:10.1016/S0167-6377(98)00031-5 |
|