1. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Math. Programming,2001
2. I. Averbakh, V. Lebedev, On the complexity of minmax regret linear programming, Working Paper, University of Toronto, 2002. Presented at the ECCO XV Conference in Lugano, Switzerland, May 30–June 1, 2002.
3. Robust convex optimization;Ben-Tal;Math. Oper. Res.,1998
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Resource Allocation Problems: Algorithmic Approaches;Ibaraki,1988