Interval data minmax regret network optimization problems. - Igor Averbakh; Vasilij Lebedev (Discret. Appl. Math., 2004)

On the complexity of minmax regret linear programming. - Igor Averbakh; Vasilij Lebedev (Eur. J. Oper. Res., 2005)

Complexity of minimizing the total flow time with interval data and minmax regret criterion. - Vasilij Lebedev; Igor Averbakh (Discret. Appl. Math., 2006)

The competitive salesman problem on a network: a worst-case approach. - Igor Averbakh; Vasilij Lebedev (Oper. Res. Lett., 2006)