Associate Chair – Faculty

Email: averbakh@utsc.utoronto.ca

Phone: 416-287-7329

Website: Rotman School of Management website

Location: IC 378

Igor Averbakh is a Professor in the Department of Management at the University of Toronto Scarborough, with a cross-appointment to the Operations Management area at Rotman School of Management.

His research focuses in 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. He has received a number of awards and grants from various sources, including NSERC and the University of Toronto's Connaught Fund.

Ph.D., Moscow Institute of Physics and Technology

M.Sc., Moscow Institute of Physics and Technology

Prof. Averbakh teaches courses in Management Science and Business Statistics.

- Optimization Under Uncertainty
- Discrete Optimization
- Logistics
- Facilities Location
- Network Models
- Production Scheduling

(1) NSERC discovery grant, 2017-23

(2) NSERC discovery grant, 2012-17

(3) NSERC discovery grant, 2006-12

(4) NSERC operating grant, 2005-06

(5) NSERC operating grant, 2001-05

(6) Connaught Grant, 2000-02, University of Toronto

(7) Dean’s merit award for research, 2005, UTSC

(8) Provost’s award for outstanding teaching (special raise), Western Washington University, 1999

(9) Provost’s award for outstanding research (special raise), Western Washington University, 1999

(10) Project Development Award, 1997-98, Western Washington University

(11) Summer Research Grant, 1997, Western Washington University

(12) Post-Doctoral Fellowship 1992-94, University of Toronto

(13) Doctoral Scholarship 1987-90, Moscow Institute of Physics and Technology

(14) Honour Student Scholarship, 1985-87, Moscow Institute of Physics and Technology

(15) Various awards for academic competitions among students, the highest: 2-nd prizes in all-Russian and all-Soviet Union mathematics Olympiads

Books

I.Averbakh and V.Tsurkov. Large-Scale Optimization Problems with Integer Variables and Block Structure. Moscow, Nauka PhysMathLit Publ., 1995. 226 pages

87. *T.Wang* and *I.Averbakh*. Network construction / restoration problems: cycles and complexity. *Journal of Combinatorial Optimization*, to appear.

86. *I.Averbakh*. The pairwise flowtime network construction problem. *Operations Research Letters* 49 (6) (2021), 902-907.

85*. I.Averbakh, O.Berman, J.Kalcsics*, and *D.Krass*. Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. *Discrete Applied Mathematics* 300 (2021), 36-55.

84. *I.Averbakh* and *J.Pereira.* Tree optimization based heuristics and metaheuristics in network construction problems. *Computers and Operations Research* 128 (2021) 105190, pp. 1-15.

83. *I.Averbakh* and *Wei Yu*. Multi-depot traveling salesmen location problems on networks with special structure. *Annals of Operations Research* 286 (1), 2020, 635-648.

82. I.Averbakh and J.Pereira. Lateness minimization in pairwise connectivity restoration problems. *INFORMS Journal on Computing* 30 (3), 2018, 522-538.

81. I.Averbakh, O.Berman, and M.Leal. Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. *Discrete Applied Mathematics* 239, 2018, 193-199.

80. I.Averbakh. Minimizing the makespan in multi-server network restoration problems. *Networks *70 (1), 2017, 60-68.

79. Z.Shao, I.Averbakh, and R.Solis-Oba. L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs. *Discrete Applied Mathematics* 221, 2017, 106-114.

78. Z.Shao, I.Averbakh, and S.Klavzar. Labeling dot-Cartesian and dot-lexicographic product graphs with a condition at distance two. *The Computer Journal *59 (1), 2016, 151-158.

77. I.Averbakh, O.Berman, J.Kalcsics, and D.Krass. Structural properties of Voronoi diagrams in facility location problems with continuous demand. *Operations Research* 63 (2), 2015, 394-411.

76. I.Averbakh and J.Pereira. Network construction problems with due dates. *European Journal of Operational Research *244, 2015, 715-729.

75. I.Averbakh, O.Berman, J.Kalcsics, D.Krass, and S.Nickel. Cooperative covering problems on networks. Networks 63 (4), 2014, 334-349.

74. M.J.Feizollahi and I.Averbakh. The robust (minmax regret) quadratic assignment problem with interval flows. INFORMS Journal on Computing 26 (2) 2014, 321-335.

73. M.Araghi, I.Averbakh, and O.Berman. Minisum multipurpose trip location problem on trees. Networks 63 (2) (2014), 154-159.

72. I.Averbakh and M.Baysan. Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem. Operations Research Letters 41 (6) (2013), 710-714.

71. J.Pereira and I.Averbakh. The robust set covering problem with interval data. Annals of Operations Research. 207 (1) (2013), 217-235.

70. I. Averbakh and M.Baysan. Batching and delivery in semi-online distribution systems. Discrete Applied Mathematics 161 (1-2) (2013), 28-42.

69. I.Averbakh. Emergency path restoration problems. Discrete Optimization 9 (1) (2012), 58-64.

68. I.Averbakh and J.Pereira. The flowtime network construction problem. IIE Transactions 44 (8) (2012), 681-694.

67. I.Averbakh and M.Baysan. Semi-online two-level supply chain scheduling problems. Journal of Scheduling 15 (3) (2012), 381-390.

66. I.Averbakh and Y.Zhao. Robust univariate spline models for interpolating interval data. Operations Research Letters 39 (1) (2011), 62-66.

65. J.Pereira and I.Averbakh. Exact and heuristic algorithms for the interval data robust assignment problem. Computers and Operations Research 38 (8) (2011), 1153-1163.

64. I.Averbakh. Nash equilibria in competitive project scheduling. European Journal of Operational Research. 205 (3) (2010), 552-556

63. I.Averbakh. Minmax regret bottleneck problems with solution-induced interval uncertainty structure. Discrete Optimization. 7 (3) (2010), 181-190.

62. I.Averbakh. On-line integrated production-distribution scheduling problems with capacitated deliveries. European Journal of Operational Research 200 (2) (2010), 377-384.

61. I.Averbakh, S. Fang, and Y.Zhao. Robust univariate cubic L2 splines: interpolating data with uncertain positions of measurements. Journal of Industrial and Management Optimization 5 (2) (2009), 351-361.

60. I.Averbakh and Y.Zhao. Relaxed robust second-order cone programming. Applied Mathematics and Computation 210 (2) (2009), 387-397.

59. D.Arivudainambi, I.Averbakh, and O.Berman. Stationary analysis of a single server retrial queue with priority and vacation. International Journal of Operational Research 5 (1) (2009), 26-47.

58. I.Averbakh and Y.Zhao. Explicit reformulations for robust optimization problems with general uncertainty sets. SIAM Journal on Optimization.18 (4) (2008), 1436-1466.

57. I.Averbakh, V.Lebedev, and V.Tsurkov. Nash equilibria solutions in the competitive salesmen problem on a network. Applied Computational Mathematics 7 (1) (2008), 54-65.

56. I.Averbakh, O.Berman, Z.Drezner, and G.Wesolowsky. The Uncapacitated Facility Location Problem with Demand-Dependent Setup Costs and Customer-Choice Allocation. European Journal of Operational Research. 179 (2007), 956-967.

55. I Averbakh and Z.Xue. On-line supply chain scheduling problems with pre-emption. European Journal of Operational Research. 181 (2007), 500-504.

54. I.Averbakh, O.Berman, and I.Chernykh. The Routing Open-Shop Problem on a Network: Complexity and Approximation. European Journal of Operational Research 173 (2) (2006), 531-539.

53. I.Averbakh. The Minmax Regret Permutation Flow Shop Problem with Two Jobs. European Journal of Operational Research 169 (3) (2006), 761-766.

52. I.Averbakh and V.Lebedev. The Competitive Salesman Problem on a Network: a Worst-Case Approach. Operations Research Letters 34 (2) (2006), 165-174.

51. V.Lebedev and I.Averbakh. Complexity of Minimizing the Total Flow Time with Interval Data and Minmax Regret Criterion. Discrete Applied Mathematics. 154 (15) (2006), 2167-2177.

50. I.Averbakh. Computing and Minimizing the Relative Regret in Combinatorial Optimization with Interval Data. Discrete Optimization 2 (4) (2005), 273-287.

49. I.Averbakh and V.Lebedev. Project Scheduling under Competition. Naval Research Logistics 52 (6) (2005), 481-492.

48. I.Averbakh and S.Bereg. Facility Location Problems with Uncertainty on the Plane. Discrete Optimization 2 (1) (2005), 3-34.

47. I.Averbakh, O.Berman, and I.Chernykh.The m-Machine Flow-Shop Problem with Unit-Time Operations and In-tree Precedence Constraints. Operations Research Letters 33 (3) (2005), 263-266.

46. I.Averbakh. The Minmax Relative Regret Median Problem on Networks. INFORMS Journal on Computing 17 (4) (2005), 451-461.

45. I.Averbakh, O.Berman, and I.Chernykh. A 6/5-Approximation Algorithm for the Two-Machine Routing Open-Shop Problem on a 2-Node Network. European Journal of Operational Research 166 (1) (2005), 3-24.

44. I Averbakh and V.Lebedev. On the Complexity of Minmax Regret Linear Programming. European Journal of Operational Research 160 (1) (2005), 227-231.

43. I.Averbakh and V.Lebedev. Interval Data Minmax Regret Network Optimization Problems. Discrete Applied Mathematics 138 (3) (2004), 289-301.

42. I.Averbakh. Minmax Regret Linear Resource Allocation Problems. Operations Research Letters, 32 (2004), 174-180.

41. I.Averbakh. Complexity of Robust Single-Facility Location Problems on Networks with Uncertain Lengths of Edges. Discrete Applied Mathematics, 127 (2003), 505-522.

40. I.Averbakh and O.Berman. An Improved Algorithm for the Minmax Regret Median Problem on a Tree. Networks, 41 (2) (2003), 97-103.

39. I.Averbakh and O.Berman. Parallel NC-Algorithms for Multifacility Location Problems with Mutual Communication and Their Applications. Networks,

40 (2002), 1-12.

38. I.Averbakh and O.Berman. Minmax p-Traveling Salesmen Location Problems on a Tree. Annals of Operations Research, 110 (2002),55-68.

37. I.Averbakh. On the Complexity of a Class of Combinatorial Optimization Problems with Uncertainty. Mathematical Programming, 90 (2001), 263-272.

36. I.Averbakh. Minmax Regret Solutions for Minimax Optimization Problems with Uncertainty. Operations Research Letters, 27 (2000), 57-65.

35. I.Averbakh and O.Berman. Minmax Regret Median Location on a Network Under Uncertainty. INFORMS Journal on Computing, 12 (2) (2000), 104-110.

34. I.Averbakh and O.Berman. Algorithms for the Robust 1-Center Problem on a Tree. European Journal of Operational Research, 123 (2000), 292-302.

33. I.Averbakh and O.Berman. Parallel Complexity of Additive Location Problems. INFORMS Journal on Computing, 11(3) (1999), 292-298.

32. I.Averbakh and O.Berman. A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems. Operations Research, 47 (1) (1999), 165-170.

31. I.Averbakh and O.Berman. Algorithms for Path Medi-Centers of a Tree. Computers and Operations Research, 26 (1999), 1395-1409.

30. I.Averbakh, O.Berman, Z.Drezner and G.Wesolowsky. The Plant Location Problem with Demand-Dependent Setup Costs and Centralized Allocation. European Journal of Operational Research, 111 (1998), 543-554.

29. I.Averbakh and O.Berman. Location Problems with Grouped Structure of Demand: Complexity and Algorithms. Networks, 31 (1998), 81-92

28. I.Averbakh and O.Berman. -Approximate Algorithms for p-Traveling Salesmen Problems on a Tree with Minmax Objective. Discrete Applied Mathematics, 75 (1997) 201-216

27. I.Averbakh and O.Berman. Minimax Regret p-Center Location on a Network with Demand Uncertainty. Location Science, 5 (4) (1997) 247-254.

26. I.Averbakh and O.Berman. Routing Two-Machine Flowshop Problems on Networks with Special Structure. Transportation Science, 30 (4) (1996), 303-314.

25. I.Averbakh and O.Berman. Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints. INFORMS Journal of Computing, 8 (1996) No.4, 361-366.

24. I.Averbakh and O.Berman. A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree. Transportation Science, 30 (3), 1996, 261-269

23. I.Averbakh and O.Berman. Locating Flow-Capturing Units on a Network with Multi-Counting and Diminishing Returns to Scale. European Journal of Operational Research, 91 (1996) 495-506

22. I.Averbakh and O.Berman. A Heuristic with Worst-Case Analysis for Minimax Routing of Two Traveling Salesmen on a Tree. Discrete Applied Mathematics, 68 (1996), 17-32

21. I.Averbakh, O.Berman and A.P.Punnen. Constrained Matroidal Bottleneck Problems. Discrete Applied Mathematics, 63 (1995) 201-214

20. I.Averbakh and O.Berman. Sales-Delivery Man Problems on Tree-Like Networks. Networks, 25, 45-58, 1995

19. I.Averbakh and O.Berman. Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree. Transportation Science, 29 (2), 184-197, 1995

18. I.Averbakh and O.Berman. Categorized Bottleneck-Minisum Path Problems on Networks. Operations Research Letters, 16, 291-297, 1994

17. I.Averbakh. Probabilistic Properties of the Dual Structure of the Multidimensional Knapsack Problem and Fast Statistically Efficient Algorithms.

Mathematical Programming, 65, 311-330, 1994

16. I.Averbakh, O.Berman and D.Simchi-Levi. Probabilistic A Priori Routing-Location Problems. Naval Research Logistics, 41, 973-989, 1994

15. I Averbakh and O.Berman. Routing and Location-Routing p-Delivery Men Problems on a Path. Transportation Science, 28, No.2, 162-166, 1994.

14. I.Averbakh. Ladder-Like Two-Level Systems with Mixed Variables. Journal of Computer and Systems Sciences International , 31 (5), 135-141, 1993.

13. I.Averbakh. Group-Theoretic Decomposition Methods in Integer Linear Programming. Computational Mathematics and Mathematical Physics, 32, No.8, 1097-1108, 1992.

12. I.Averbakh. An Iterative Method of Solving Two-Stage Discrete Stochastic Programming Problems with Additively Separable Variables. Computational Mathematics and Mathematical Physics, 31, No.6, 21-27, 1991.

11. I.Averbakh. Multilevel Decomposition in Mixed-Integer Programming with Block Structure. Automation and Remote Control, 52, No.11, 1582-1587, 1991.

10. I.Averbakh. On the Saddle Points of the Lagrange Function of the m-Dimensional Knapsack Problem. Soviet Mathematics Doklady, 41, No.1, 32-34, 1990

9. I.Averbakh. An Iterative Decomposition Method for Solving Single-Stage Stochastic Integer Programming Problems. Computational Mathematics and Mathematical Physics, 30, N5, 133-139, 1990

8. I.Averbakh. Composite Decomposition in Integer Linear Programming with Block Structure. Automation and Remote Control, 51, No.7 (part 2), 947-952, 1990

7. I.Averbakh. An Algorithm for the Multiknapsack Problem with Random Coefficients. Diskretnaya Matematika (Discrete Mathematics), 2, No.3, p.3-9, 1990 (in Russian)

6. I.Averbakh. An Adaptive Method of Optimization for Two-Stage Stochastic Systems with Discrete Variables. Journal of Computer and Systems Sciences International, 28, No.4, 161-165, 1990

5. V.Mednitsky and I.Averbakh. A Stochastic Model of a Dynamic Production System. Economics and Mathematical Methods, 27, No.2, 383-391, 1991 (in Russian)

4. I.Averbakh and V.Tsurkov. Some Probabilistic Properties of Integer Linear Programming Problems. Kibernetika (Cybernetics) No.2, 120-123, 1991 (in Russian)

3. I.Averbakh and V.Tsurkov. Mixed-Integer Programming Problems with Block Structure and Coupling Variables. Kibernetika i Vichislitelnaya Tekhnika (Cybernetics and Computers), Kiev, 89, 62-67, 1991 (in Russian)

2. V.Mednitsky and I.Averbakh. A Deterministic Model of a Dynamic Production System. Economics and Mathematical Methods, 26, No.6, 1111-1124, 1990 (in Russian)

1. I.Averbakh and V.Tsurkov. Integer Optimization Models of Block Type (Survey). Matematicheskoye Modelirovanie (Mathematical Modeling), 2, No.2, 39-57,1990 (in Russian)