World's Best Scientists 2026 revealed!

Overview

Igor Averbakh is affiliated with the University of Toronto in Canada and conducts research primarily in the fields of Engineering and Computer Science. Their work spans multiple subfields including Industrial and Manufacturing Engineering, Electrical and Electronic Engineering, Organizational Behavior and Human Resource Management, Transportation, and Signal Processing.

The main topics of Igor Averbakh's research encompass:

  • Vehicle Routing Optimization Methods
  • Facility Location and Emergency Management
  • Transportation Planning and Optimization
  • Advanced Optical Network Technologies
  • Data Management and Algorithms
  • VLSI and FPGA Design Techniques
  • Transportation and Mobility Innovations

Igor Averbakh has contributed to several scholarly publications with a focus on network construction and optimization problems. Selected recent papers include:

  • Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams, 2021, Discrete Applied Mathematics
  • Network construction/restoration problems: cycles and complexity, 2021, Journal of Combinatorial Optimization
  • Tree optimization based heuristics and metaheuristics in network construction problems, 2020, Computers & Operations Research
  • Minimizing the total weighted pairwise connection time in network construction problems, 2021, arXiv (Cornell University)
  • The pairwise flowtime network construction problem, 2021, Operations Research Letters

Frequently, Igor Averbakh collaborates with other researchers including Jordi Pereira, Oded Berman, Jörg Kalcsics, Dmitry Krass, and Tianyu Wang. This network of coauthors reflects interdisciplinary interaction within computational optimization and operations research domains.

Their work has appeared in a range of publication venues where multiple contributions have been made, notably:

  • arXiv (Cornell University)
  • Discrete Applied Mathematics
  • Journal of Combinatorial Optimization
  • Computers & Operations Research
  • Operations Research Letters

Igor Averbakh's research combines algorithmic approaches with practical applications relevant to transportation systems, facility location planning, and network construction problems. Their scholarly output contributes to developing optimization techniques used in engineering and computer science contexts, integrating theoretical frameworks with applied problem solving.

Best Publications

  • On the complexity of a class of combinatorial optimization problems with uncertainty

    Igor Averbakh

  • Minmax regret solutions for minimax optimization problems with uncertainty

    Igor Averbakh

  • Interval data minmax regret network optimization problems

    Igor Averbakh;Vasilij Lebedev

  • Minimax regret p-center location on a network with demand uncertainty

    I. Averbakh;Oded Berman

  • Minmax Regret Median Location on a Network Under Uncertainty

    Igor Averbakh;Oded Berman

  • Algorithms for the robust 1-center problem on a tree

    Igor Averbakh;Oded Berman

  • Complexity of minimizing the total flow time with interval data and minmax regret criterion

    Vasilij Lebedev;Igor Averbakh

  • On-line supply chain scheduling problems with preemption

    Igor Averbakh;Zhihui Xue

  • A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree

    Igor Averbakh;Oded Berman

  • On the complexity of minmax regret linear programming

    Igor Averbakh;Vasilij Lebedev

  • On-line integrated production–distribution scheduling problems with capacitated deliveries

    Igor Averbakh

  • Complexity of robust single facility location problems on networks with uncertain edge lengths

    Igor Averbakh

  • The routing open-shop problem on a network: Complexity and approximation

    Igor Averbakh;Oded Berman;Ilya Chernykh

  • ( p -1)/( p +1)-approximate algorithms for p -traveling salemen problems on a tree with minmax objective

    Igor Averbakh;Oded Berman

  • A 65-approximation algorithm for the two-machine routing open-shop problem on a two-node network

    Igor Averbakh;Oded Berman;Ilya Chernykh

  • Locating flow-capturing units on a network with multi-counting and diminishing returns to scale

    Igor Averbakh;Oded Berman

  • Exact and heuristic algorithms for the interval data robust assignment problem

    Jordi Pereira;Igor Averbakh

  • Sales‐delivery man problems on treelike networks

    Igor Averbakh;Oded Berman

  • Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path

    Igor Averbakh;Oded Berman

  • Facility location problems with uncertainty on the plane

    Igor Averbakh;Sergei Bereg

Frequent Co-Authors

Oded Berman
Oded Berman University of Toronto
Dmitry Krass
Dmitry Krass University of Toronto
Sandi Klavžar
Sandi Klavžar University of Ljubljana
Zvi Drezner
Zvi Drezner California State University, Fullerton
George O. Wesolowsky
George O. Wesolowsky McMaster University
Stefan Nickel
Stefan Nickel Karlsruhe Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, pursuing related online degrees can open diverse career pathways. Many professionals complement their math skills with business or finance qualifications to boost their marketability. For instance, those looking for a business edge might explore the easiest online mba programs, which provide flexible options ideal for working students aiming to quickly enhance leadership skills.

Cost is often a major consideration, and there are many most affordable online dba programs that allow students to pursue a Doctor of Business Administration without a hefty financial burden. This can be a strategic step for mathematicians interested in advanced research or executive roles in analytics-driven businesses.

For those focused on finance, combining math expertise with a specialized degree can be beneficial. The best online masters in finance offer affordable pathways to specialize in financial modeling, risk management, or quantitative analysis.

Finally, many seek to accelerate their education with the shortest online mba programs, which enable quicker transitions into managerial roles. These programs often emphasize practical applications, ideal for math graduates aiming to fast-track their careers in tech, finance, or consulting sectors.

Best Scientists Citing Igor Averbakh

Trending Scientists

Recently Published Articles