| |
| 2006 | ||
|---|---|---|
| 4 | EE | Vasilij Lebedev, Igor Averbakh: Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discrete Applied Mathematics 154(15): 2167-2177 (2006) |
| 3 | EE | Igor Averbakh, Vasilij Lebedev: The competitive salesman problem on a network: a worst-case approach. Oper. Res. Lett. 34(2): 165-174 (2006) |
| 2005 | ||
| 2 | EE | Igor Averbakh, Vasilij Lebedev: On the complexity of minmax regret linear programming. European Journal of Operational Research 160(1): 227-231 (2005) |
| 2004 | ||
| 1 | EE | Igor Averbakh, Vasilij Lebedev: Interval data minmax regret network optimization problems. Discrete Applied Mathematics 138(3): 289-301 (2004) |
| 1 | Igor Averbakh | [1] [2] [3] [4] |