Igor Averbakh
Bio
Igor Averbakh is a Professor, Department of Management at the University of Toronto Scarborough, with a cross-appointment to the Operations Management area at Rotman. He has received several awards and grants including NSERC and Connaught. His research focuses on discrete optimization, optimization under uncertainty, facilities location, network optimization, logistics, routing and scheduling. He teaches on the topics of Management Science and Operations Research, Optimization, Network Models and Statistics.
Academic Positions
-
2007-present
Professor, University of Toronto
-
2000-2007
Associate Professor, University of Toronto
-
1996-2000
Assistant Professor, Western Washington University
-
1995-96
Assistant Professor, University of Toronto
-
1992-95
Post-Doctorate and Research Associate, University of Toronto
-
1990-92
Assistant Professor, Chelyabinsk Technical University, Russia
Selected Publications - Papers
-
Network construction / restoration problems: cycles and complexity.
T.Wang and I.Averbakh
Journal of Combinatorial Optimization
Issue:44 (2)
2022
Pages: 1-23
-
The pairwise flowtime network construction problem
I.Averbakh
Operations Research Letters
Issue:49 (6)
2021
Pages: 902-907
-
Location problems with continuous demand and unreliable facilities: Applications of families of Voronoi diagrams
I.Averbakh, O.Berman, J.Kalcsics, and D.Krass
Discrete Applied Mathematics
Issue:300
2021
Pages: 36-55
-
Tree optimization based heuristics and metaheuristics in network construction problems
I.Averbakh and J.Pereira
Computers and Operations Research
Issue:128 - 105190
2021
Pages: 1-15
-
Multi-depot traveling salesmen location problems on networks with special structure
I.Averbakh and W.Yu
Annals of Operations Research
Issue:286 (1)
2020
Pages: 635-648
-
Lateness minimization in pairwise connectivity restoration problems
I.Averbakh and J.Pereira
INFORMS Journal on Computing
Issue:30 (3)
2018
Pages: 522-538
-
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
I.Averbakh, O.Berman and M.Leal
Discrete Applied Mathematics
Issue:239
2018
Pages: 193-199
-
Minimizing the makespan in multi-server network restoration problems
I.Averbakh
Networks
Issue:70 (1)
2017
Pages: 60-68
-
Structural properties of Voronoi diagrams in facility location problems with continuous demand
I.Averbakh, O.Berman, J.Kalcsics, and D.Krass
Operations Research
Issue:63 (2)
2015
Pages: 394-411
-
Network construction problems with due dates
I.Averbakh and J.Pereira
European Journal of Operational Research
Issue:244
2015
Pages: 715-729
-
Cooperative covering problems on networks
I.Averbakh, O.Berman, J.Kalcsics, and S.Nickel
Networks
Issue:63 (4)
2014
Pages: 334-349
-
The robust (minmax regret) quadratic assignment problem with interval flows
M.Feizollahi and I.Averbakh
INFORMS Journal on Computing
Issue:26 (2)
2014
Pages: 321-335
-
Minisum multipurpose trip location problem on trees
M.Araghi, I.Averbakh, and O.Berman
Networks
Issue:63 (2)
2014
Pages: 154-159
-
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
I.Averbakh and M.Baysan
Operations Research Letters
Issue:41 (6)
2013
Pages: 710-714
-
The robust set-covering problem with interval data
J.Pereira and I.Averbakh
Annals of Operations Research
Issue:207
2013
Pages: 217-235
-
Batching and delivery in semi-online distribution systems
I.Averbakh and M.Baysan
Discrete Applied Mathematics
Issue:161 (1-2)
2013
Pages: 28-42
-
Emergency path restoration problems
I.Averbakh
Discrete Optimization
Issue:Volume 9
2012
Pages: 58-64
-
Semi-online two-level supply chain scheduling problems
I.Averbakh and M.Baysan
Journal of Scheduling
Issue:Volume 15
2012
Pages: 381-390
-
The flowtime network construction problem
I.Averbakh and J.Pereira;
IIE Transactions
Issue:44 (8)
2012
Pages: 681-694
-
Robust univariate spline models for interpolating interval data
I.Averbakh and Y.Zhao
Operations Research Letters
Issue:Volume 39 (1)
2011
Pages: 62-66
-
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
I.Averbakh
Discrete Optimization
Issue:Volume 7 (3)
2010
Pages: 181-190
-
Nash equilibria in competitive project scheduling
I.Averbakh
European Journal of Operational Research
Issue:Volume 205 (3)
2010
Pages: 552-556
-
On-line integrated production-distribution scheduling problems with capacitated deliveries
I.Averbakh
European Journal of Operational Research
Issue:Volume 200 (2)
2010
Pages: 377-384
-
Explicit reformulations for robust optimization problems with general uncertainty sets
I.Averbakh and Y.Zhao
SIAM Journal on Optimization
Issue:Volume18 (4)
2008
Pages: 1436-1466
-
On-line supply chain scheduling problems with preemption
I.Averbakh and Z.Xue
European Journal of Operational Research
Issue:181
2007
Pages: 500-504
-
The uncapacitated facility location problem with demand-dependent setup costs and customer-choice allocation
I.Averbakh, O.Berman, Z.Drezner, and G.Wesolowsky
European Journal of Operational Research
Issue:179
2007
Pages: 956-967
-
Complexity of minimizing the total flow time with interval data and minmax regret criterion
V.Lebedev, I.Averbakh
Discrete Applied Mathematics
Issue:154
2006
Pages: 2167-2177
-
The competitive salesman problem on a network: a worst-case approach
I.Averbakh and V.Lebedev
Operations Research Letters
Issue:34 (2)
2006
Pages: 165-174
-
The minmax regret permutation flow-shop problem with two jobs
I.Averbakh
European Journal of Operational Research
Issue:169 (3)
2006
Pages: 761-766
-
The routing open-shop problem on a network: complexity and approximation
I.Averbakh, O.Berman, I.Chernykh
European Journal of Operational Research
Issue:173 (2)
2006
Pages: 531-539
-
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a 2-node network
I.Averbakh, O.Berman, I.Chernykh
European Journal of Operational Research
Issue:166 (1)
2005
Pages: 3-24
-
Computing and minimizing the relative regret in combinatorial optimization with interval data
I.Averbakh
Discrete Optimization
Issue:2 (4)
2005
Pages: 273-287
-
Facility location problems with uncertainty on the plane
I.Averbakh, S.Bereg
Discrete Optimization
Issue:2 (1)
2005
Pages: 3-34
-
On the complexity of minmax regret linear programming
I.Averbakh, V.Lebedev
European Journal of Operational Research
Issue:160(1)
2005
Pages: 227-231
-
Project scheduling under competition
I.Averbakh and V.Lebedev
Naval Research Logistics
Issue:52 (6)
2005
Pages: 481-492
-
The minmax relative regret median problem on networks
I.Averbakh
INFORMS Journal on Computing
Issue:17 (4)
2005
Pages: 451-461
-
The m-machine flow-shop with unit-time operations and intree precedence constraints
I.Averbakh, O.Berman, I.Chernykh
Operations Research Letters
Issue:33 (3)
2005
Pages: 263-266
-
Interval data minmax regret network optimization problems
I.Averbakh, V.Lebedev
Discrete Applied Mathematics
Issue:138(3)
2004
Pages: 289-301
-
Minmax regret linear resource allocation problems
I.Averbakh
Operations Research Letters
Issue:32
2004
Pages: 174-180
-
An improved algorithm for the minmax regret median problem on a tree
I.Averbakh and O.Berman
Networks
Issue:41 (2)
2003
Pages: 97-103
-
Complexity of robust single-facility location problems on networks with uncertain lengths of edges
I.Averbakh
Discrete Applied Mathematics
Issue:127
2003
Pages: 505-522
-
Minmax p-traveling salesmen location problems on a tree
I.Averbakh and O.Berman
Annals of Operations Research
Issue:110
2002
Pages: 55-68
-
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
I.Averbakh and O.Berman
Networks
Issue:40
2002
Pages: 1-12
-
On the complexity of a class of combinatorial optimization problems with uncertainty
I.Averbakh
Mathematical Programming
Issue:90
2001
Pages: 263-272
-
Algorithms for the robust 1-center problem on a tree
I.Averbakh and O.Berman
European Journal of Operational Research
Issue:123
2000
Pages: 292-302
-
Minmax regret median location on a network under uncertainty
I.Averbakh and O.Berman
INFORMS Journal on Computing
Issue:12 (2)
2000
Pages: 104-110
-
Minmax regret solutions for minimax optimization problems with uncertainty
I.Averbakh
Operations Research Letters
Issue:27
2000
Pages: 57-65
-
Parallel complexity of additive location problems
I.Averbakh and O.Berman
INFORMS Journal on Computing
Issue:123
2000
Pages: 292-298
-
A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems
I.Averbakh and O.Berman
Operations Research
Issue:47 (1)
1999
Pages: 165-170
Research and Teaching Interests
Research Interests: Discrete Optimization, Optimization under Uncertainty, Facilities Location, Network Optimization, Logistics, Routing, Scheduling.
Teaching : Management Science / Operations Research, Optimization, Network Models, Statistics