Calculation of stability radii for combinatorial optimization problems
August 1998
Article
pp 1-7.
This publication is part of collection
| Related Files |
|---|
|
Redirect to publisher's version
(publisher's version.url.txt, 51 bytes) |
Repository contains one additional file which is not publicly available
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.
Keywords
- computational complexity
- binary programming
- sensibility analysis
- postoptimal analysis
- stability radius
- tolerance approach
