Sciweavers

ORL
1998

Calculation of stability radii for combinatorial optimization problems

13 years 10 months ago
Calculation of stability radii for combinatorial optimization problems
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.
Nilotpal Chakravarti, Albert P. M. Wagelmans
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where ORL
Authors Nilotpal Chakravarti, Albert P. M. Wagelmans
Comments (0)