Igor Averbakh

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