<?xml version="1.0" encoding="UTF-8" standalone="no" ?>
<rss version="2.0">
  <channel>
    <title>Chakravarti, N.</title>
    <link>http://repub.eur.nl/res/aut/976/</link>
    <description>List of Publications</description>
    <language>en</language>
    <image>
      <url>http://repub.eur.nl/static-eur/img/logo.png</url>
      <title>RePub, Erasmus University Rotterdam</title>
      <link>http://repub.eur.nl</link>
    </image>
    <item>
      <title>Calculation of stability radii for combinatorial optimization problems (Article)</title>
      <link>http://repub.eur.nl/res/pub/14443/</link>
      <pubDate>1998-08-01T00:00:00Z</pubDate>
      <description>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.</description>
    </item> <item>
      <title>Calculation of Stability Radii for Combinatorial Optimization Problems (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/1403/</link>
      <pubDate>1997-01-01T00:00:00Z</pubDate>
      <description>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.</description>
    </item>
  </channel>
</rss>