Igor Averbakh

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 14

Top Topics

Location Problems

Top Venues

Discret. Appl. Math.

INFORMS J. Comput.

Publications

Igor Averbakh, Wei Yu
The probabilistic uncapacitated open vehicle routing location problem. Networks 82 (1) (2023)
Tianyu Wang, Igor Averbakh
Network construction/restoration problems: cycles and complexity. J. Comb. Optim. 44 (1) (2022)
Igor Averbakh, Jordi Pereira
Tree optimization based heuristics and metaheuristics in network construction problems. Comput. Oper. Res. 128 (2021)
Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. Discret. Appl. Math. 300 (2021)
Igor Averbakh
The pairwise flowtime network construction problem. Oper. Res. Lett. 49 (6) (2021)
Igor Averbakh
Minimizing the total weighted pairwise connection time in network construction problems. CoRR (2021)
Igor Averbakh, Wei Yu
Multi-depot traveling salesmen location problems on networks with special structure. Ann. Oper. Res. 286 (1) (2020)
Igor Averbakh, Jordi Pereira
Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems. CoRR (2020)
Zhendong Shao, Igor Averbakh
The L(j, k)-Edge-Labeling Problem on Graphs. Ars Comb. 137 (2018)
Igor Averbakh, Oded Berman, Marina Leal
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. Discret. Appl. Math. 239 (2018)
Igor Averbakh, Jordi Pereira
Lateness Minimization in Pairwise Connectivity Restoration Problems. INFORMS J. Comput. 30 (3) (2018)
Zhendong Shao, Igor Averbakh, Roberto Solis-Oba
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. Discret. Appl. Math. 221 (2017)
Igor Averbakh
Minimizing the makespan in multiserver network restoration problems. Networks 70 (1) (2017)
Zhendong Shao, Igor Averbakh, Sandi Klavzar
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two. Comput. J. 59 (1) (2016)
Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand. Oper. Res. 63 (2) (2015)
Igor Averbakh, Jordi Pereira
Network construction problems with due dates. Eur. J. Oper. Res. 244 (3) (2015)
Mohammad Javad Feizollahi, Igor Averbakh
The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows. INFORMS J. Comput. 26 (2) (2014)
Mojtaba Araghi, Oded Berman, Igor Averbakh
Minisum multipurpose trip location problem on trees. Networks 63 (2) (2014)
Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel
Cooperative covering problems on networks. Networks 63 (4) (2014)
Igor Averbakh, Mehmet Baysan
Batching and delivery in semi-online distribution systems. Discret. Appl. Math. 161 (1-2) (2013)
Igor Averbakh, Mehmet Baysan
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem. Oper. Res. Lett. 41 (6) (2013)
Jordi Pereira, Igor Averbakh
The Robust Set Covering Problem with interval data. Ann. Oper. Res. 207 (1) (2013)
Igor Averbakh
Emergency path restoration problems. Discret. Optim. 9 (1) (2012)
Igor Averbakh, Mehmet Baysan
Semi-online two-level supply chain scheduling problems. J. Sched. 15 (3) (2012)
Jordi Pereira, Igor Averbakh
Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38 (8) (2011)
Igor Averbakh, Yun-Bin Zhao
Robust univariate spline models for interpolating interval data. Oper. Res. Lett. 39 (1) (2011)
Igor Averbakh
Nash equilibria in competitive project scheduling. Eur. J. Oper. Res. 205 (3) (2010)
Igor Averbakh
Minmax regret bottleneck problems with solution-induced interval uncertainty structure. Discret. Optim. 7 (3) (2010)
Igor Averbakh
On-line integrated production-distribution scheduling problems with capacitated deliveries. Eur. J. Oper. Res. 200 (2) (2010)
Igor Averbakh, Yun-Bin Zhao
Relaxed robust second-order-cone programming. Appl. Math. Comput. 210 (2) (2009)
Igor Averbakh, Yun-Bin Zhao
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets. SIAM J. Optim. 18 (4) (2008)
Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation. Eur. J. Oper. Res. 179 (3) (2007)
Igor Averbakh, Zhihui Xue
On-line supply chain scheduling problems with preemption. Eur. J. Oper. Res. 181 (1) (2007)
Igor Averbakh, Vasilij Lebedev
The competitive salesman problem on a network: a worst-case approach. Oper. Res. Lett. 34 (2) (2006)
Igor Averbakh, Oded Berman, Ilya Chernykh
The routing open-shop problem on a network: Complexity and approximation. Eur. J. Oper. Res. 173 (2) (2006)
Igor Averbakh
The minmax regret permutation flow-shop problem with two jobs. Eur. J. Oper. Res. 169 (3) (2006)
Vasilij Lebedev, Igor Averbakh
Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discret. Appl. Math. 154 (15) (2006)
Igor Averbakh, Sergey Bereg
Facility location problems with uncertainty on the plane. Discret. Optim. 2 (1) (2005)
Igor Averbakh, Oded Berman, Ilya Chernykh
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166 (1) (2005)
Igor Averbakh, Vasilij Lebedev
On the complexity of minmax regret linear programming. Eur. J. Oper. Res. 160 (1) (2005)
Igor Averbakh
Computing and minimizing the relative regret in combinatorial optimization with interval data. Discret. Optim. 2 (4) (2005)
Igor Averbakh
The Minmax Relative Regret Median Problem on Networks. INFORMS J. Comput. 17 (4) (2005)
Igor Averbakh, Oded Berman, Ilya Chernykh
-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33 (3) (2005)
Igor Averbakh
Minmax regret linear resource allocation problems. Oper. Res. Lett. 32 (2) (2004)
Igor Averbakh, Vasilij Lebedev
Interval data minmax regret network optimization problems. Discret. Appl. Math. 138 (3) (2004)
Igor Averbakh, Oded Berman
An improved algorithm for the minmax regret median problem on a tree. Networks 41 (2) (2003)
Igor Averbakh
Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths. Discret. Appl. Math. 127 (3) (2003)
Igor Averbakh, Oded Berman
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications. Networks 40 (1) (2002)
Igor Averbakh, Oded Berman
-Traveling Salesmen Location Problems on a Tree. Ann. Oper. Res. 110 (1-4) (2002)
Igor Averbakh
On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. 90 (2) (2001)
Igor Averbakh, Oded Berman
Minmax Regret Median Location on a Network Under Uncertainty. INFORMS J. Comput. 12 (2) (2000)
Igor Averbakh, Oded Berman
Algorithms for the robust 1-center problem on a tree. Eur. J. Oper. Res. 123 (2) (2000)
Igor Averbakh
Minmax regret solutions for minimax optimization problems with uncertainty. Oper. Res. Lett. 27 (2) (2000)
Igor Averbakh, Oded Berman
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems. Oper. Res. 47 (1) (1999)
Igor Averbakh, Oded Berman
Algorithms for path medi-centers of a tree. Comput. Oper. Res. 26 (14) (1999)
Igor Averbakh, Oded Berman
Parallel Complexity of Additive Location Problems. INFORMS J. Comput. 11 (3) (1999)
Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky
The plant location problem with demand-dependent setup costs and centralized allocation. Eur. J. Oper. Res. 111 (3) (1998)
Igor Averbakh, Oded Berman
Location problems with grouped structure of demand: Complexity and algorithms. Networks 31 (2) (1998)
Igor Averbakh, Oded Berman
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. Discret. Appl. Math. 75 (3) (1997)
Igor Averbakh, Oded Berman
Routing Two-Machine Flowshop Problems on Networks with Special Structure. Transp. Sci. 30 (4) (1996)
Igor Averbakh, Oded Berman
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. Discret. Appl. Math. 68 (1-2) (1996)
Igor Averbakh, Oded Berman
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree. Transp. Sci. 30 (3) (1996)
Igor Averbakh, Oded Berman
-Connectivity Constraints. INFORMS J. Comput. 8 (4) (1996)
Igor Averbakh, Oded Berman, Abraham P. Punnen
Constrained Matroidal Bottleneck Problems. Discret. Appl. Math. 63 (3) (1995)
Igor Averbakh, Oded Berman
Sales-delivery man problems on treelike networks. Networks 25 (2) (1995)
Igor Averbakh, Oded Berman
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree. Transp. Sci. 29 (2) (1995)
Igor Averbakh, Oded Berman
Categorized bottleneck-minisum path problems on networks. Oper. Res. Lett. 16 (5) (1994)
Igor Averbakh, Oded Berman
Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path. Transp. Sci. 28 (2) (1994)
Igor Averbakh
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. Math. Program. 65 (1994)