1. H. Aissi, C. Bazgan, D. Vanderpooten, Pseudo-polynomial algorithms for min-max and min-max regret problems, in: 5th International Symposium on Operations Research and Its Applications, ISORA 2005, 2005, pp. 171–178.
2. Complexity of the min-max (regret) versions of min cut problems;Aissi;Discrete Optim.,2008
3. Robust convex optimization;Ben-Tal;Math. Oper. Res.,1998
4. Robust discrete optimization and network flows;Bertsimas;Math. Program.,2003
5. Robust combinatorial optimization under convex and discrete cost uncertainty;Buchheim;EURO J. Comput. Optim.,2018