| On the complexity of a class of combinatorial optimization problems with uncertainty I Averbakh Mathematical Programming 90, 263-272, 2001 | 226 | 2001 |
| Minmax regret solutions for minimax optimization problems with uncertainty I Averbakh Operations Research Letters 27 (2), 57-65, 2000 | 189 | 2000 |
| Interval data minmax regret network optimization problems I Averbakh, V Lebedev Discrete Applied Mathematics 138 (3), 289-301, 2004 | 182 | 2004 |
| Minimax regret p-center location on a network with demand uncertainty I Averbakh, O Berman Location Science 5 (4), 247-254, 1997 | 160 | 1997 |
| Minmax regret median location on a network under uncertainty I Averbakh, O Berman INFORMS Journal on Computing 12 (2), 104-110, 2000 | 127 | 2000 |
| Algorithms for the robust 1-center problem on a tree I Averbakh, O Berman European Journal of Operational Research 123 (2), 292-302, 2000 | 103 | 2000 |
| Complexity of minimizing the total flow time with interval data and minmax regret criterion V Lebedev, I Averbakh Discrete Applied Mathematics 154 (15), 2167-2177, 2006 | 99 | 2006 |
| A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree I Averbakh, O Berman Discrete Applied Mathematics 68 (1-2), 17-32, 1996 | 91 | 1996 |
| On-line supply chain scheduling problems with preemption I Averbakh, Z Xue European Journal of Operational Research 181 (1), 500-504, 2007 | 88 | 2007 |
| On the complexity of minmax regret linear programming I Averbakh, V Lebedev European Journal of Operational Research 160 (1), 227-231, 2005 | 86 | 2005 |
| The routing open-shop problem on a network: complexity and approximation I Averbakh, O Berman, I Chernykh European Journal of Operational Research 173 (2), 531-539, 2006 | 80 | 2006 |
| On-line integrated production–distribution scheduling problems with capacitated deliveries I Averbakh European Journal of Operational Research 200 (2), 377-384, 2010 | 76 | 2010 |
| A 65-approximation algorithm for the two-machine routing open-shop problem on a two-node network I Averbakh, O Berman, I Chernykh European Journal of Operational Research 166 (1), 3-24, 2005 | 68 | 2005 |
| Complexity of robust single facility location problems on networks with uncertain edge lengths I Averbakh Discrete Applied Mathematics 127 (3), 505-522, 2003 | 68 | 2003 |
| (p− 1)(p+ 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective I Averbakh, O Berman Discrete Applied Mathematics 75 (3), 201-216, 1997 | 65 | 1997 |
| The robust set covering problem with interval data J Pereira, I Averbakh Annals of Operations Research 207, 217-235, 2013 | 62 | 2013 |
| The flowtime network construction problem I Averbakh, J Pereira Iie Transactions 44 (8), 681-694, 2012 | 62 | 2012 |
| Facility location problems with uncertainty on the plane I Averbakh, S Bereg Discrete Optimization 2 (1), 3-34, 2005 | 62 | 2005 |
| Locating flow-capturing units on a network with multi-counting and diminishing returns to scale I Averbakh, O Berman European Journal of Operational Research 91 (3), 495-506, 1996 | 62 | 1996 |
| Exact and heuristic algorithms for the interval data robust assignment problem J Pereira, I Averbakh Computers & Operations Research 38 (8), 1153-1163, 2011 | 61 | 2011 |
