N. Chakravarti
http://repub.eur.nl/ppl/976/
List of Publicationsenhttp://repub.eur.nl/eur_signature.png
http://repub.eur.nl/
RePub, Erasmus University RepositoryCalculation of stability radii for combinatorial optimization problems
http://repub.eur.nl/pub/14443/
Sat, 01 Aug 1998 00:00:01 GMT<div>N. Chakravarti</div><div>A.P.M. Wagelmans</div>
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.Calculation of Stability Radii for Combinatorial Optimization Problems
http://repub.eur.nl/pub/1403/
Wed, 01 Jan 1997 00:00:01 GMT<div>N. Chakravarti</div><div>A.P.M. Wagelmans</div>
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.