Get started
Author

Igor Averbakh

Observed names: Averbakh, Igor, I. Averbakh, I. L. AVERBAKH, I.L. Averbakh, Igor L. Averbakh
ORCID: 0000-0001-6168-4424
Observed ORCID: 0000-0001-6168-4424
OpenAlex ID: A5071262933
On the complexity of a class of combinatorial optimization problems with uncertainty
2001 · Igor Averbakh · Mathematical Programming · 162
Minmax regret solutions for minimax optimization problems with uncertainty
2000 · Igor Averbakh · Operations Research Letters · 132
Interval data minmax regret network optimization problems
2003 · Igor Averbakh, Vasilij Lebedev · Discrete Applied Mathematics · 130
Minimax regret p-center location on a network with demand uncertainty
1997 · I. Averbakh, Oded Berman · Location Science · 118
Minmax Regret Median Location on a Network Under Uncertainty
2000 · Igor Averbakh, Oded Berman · INFORMS journal on computing · 87
Algorithms for the robust 1-center problem on a tree
2000 · Igor Averbakh, Oded Berman · European Journal of Operational Research · 83
Complexity of minimizing the total flow time with interval data and minmax regret criterion
2006 · Vasilij Lebedev, Igor Averbakh · Discrete Applied Mathematics · 71
PDF
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
1996 · Igor Averbakh, Oded Berman · Discrete Applied Mathematics · 69
PDF
On-line supply chain scheduling problems with preemption
2006 · Igor Averbakh, Zhihui Xue · European Journal of Operational Research · 63
On the complexity of minmax regret linear programming
2003 · Igor Averbakh, Vasilij Lebedev · European Journal of Operational Research · 60
On-line integrated production–distribution scheduling problems with capacitated deliveries
2009 · Igor Averbakh · European Journal of Operational Research · 56
Facility location problems with uncertainty on the plane
2005 · Igor Averbakh, Sergei Bereg · Discrete Optimization · 56
PDF
(p − 1)(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective
1997 · Igor Averbakh, Oded Berman · Discrete Applied Mathematics · 55
Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
1996 · Igor Averbakh, Oded Berman · European Journal of Operational Research · 54
Complexity of robust single facility location problems on networks with uncertain edge lengths
2003 · Igor Averbakh · Discrete Applied Mathematics · 50
Exact and heuristic algorithms for the interval data robust assignment problem
2010 · Jordi Pereira, Igor Averbakh · Computers & Operations Research · 45
The flowtime network construction problem
2012 · Igor Averbakh, Jordi Pereira · IIE Transactions · 43
The Robust Set Covering Problem with interval data
2011 · Jordi Pereira, Igor Averbakh · Annals of Operations Research · 43
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
1999 · Igor Averbakh, Oded Berman · Operations Research · 43
The routing open-shop problem on a network: Complexity and approximation
2005 · Igor Averbakh, Oded Berman, et al. · European Journal of Operational Research · 42
An improved algorithm for the minmax regret median problem on a tree
2003 · Igor Averbakh, Oded Berman · Networks · 42
Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
1994 · Igor Averbakh, Oded Berman · Transportation Science · 39
A -approximation algorithm for the two-machine routing open-shop problem on a two-node network
2004 · Igor Averbakh, Oded Berman, et al. · European Journal of Operational Research · 38
Computing and minimizing the relative regret in combinatorial optimization with interval data
2005 · Igor Averbakh · Discrete Optimization · 37
PDF
Sales‐delivery man problems on treelike networks
1995 · Igor Averbakh, Oded Berman · Networks · 36
Works count: 83
Citation count: 2,181
H-index: 28
I10-index: 47
Year
Topic
Type