Igor Averbakh
Orcid: 0000-0001-6168-4424
According to our database1,
Igor Averbakh
authored at least 68 papers
between 1994 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Networks, July, 2023
2022
J. Comb. Optim., 2022
2021
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams.
Discret. Appl. Math., 2021
Minimizing the total weighted pairwise connection time in network construction problems.
CoRR, 2021
Tree optimization based heuristics and metaheuristics in network construction problems.
Comput. Oper. Res., 2021
2020
Ann. Oper. Res., 2020
2018
INFORMS J. Comput., 2018
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights.
Discret. Appl. Math., 2018
The L(j, k)-Edge-Labeling Problem on Graphs.
Ars Comb., 2018
2017
Discret. Appl. Math., 2017
2016
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two.
Comput. J., 2016
2015
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand.
Oper. Res., 2015
2014
INFORMS J. Comput., 2014
2013
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem.
Oper. Res. Lett., 2013
Discret. Appl. Math., 2013
2012
2011
Oper. Res. Lett., 2011
Comput. Oper. Res., 2011
2010
On-line integrated production-distribution scheduling problems with capacitated deliveries.
Eur. J. Oper. Res., 2010
Minmax regret bottleneck problems with solution-induced interval uncertainty structure.
Discret. Optim., 2010
2009
2008
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets.
SIAM J. Optim., 2008
2007
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation.
Eur. J. Oper. Res., 2007
2006
Oper. Res. Lett., 2006
Eur. J. Oper. Res., 2006
Eur. J. Oper. Res., 2006
Complexity of minimizing the total flow time with interval data and minmax regret criterion.
Discret. Appl. Math., 2006
2005
The <i>m</i>-machine flowshop problem with unit-time operations and intree precedence constraints.
Oper. Res. Lett., 2005
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.
Eur. J. Oper. Res., 2005
Computing and minimizing the relative regret in combinatorial optimization with interval data.
Discret. Optim., 2005
2004
Discret. Appl. Math., 2004
2003
Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths.
Discret. Appl. Math., 2003
2002
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications.
Networks, 2002
Ann. Oper. Res., 2002
2001
On the complexity of a class of combinatorial optimization problems with uncertainty.
Math. Program., 2001
2000
Oper. Res. Lett., 2000
INFORMS J. Comput., 2000
1999
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems.
Oper. Res., 1999
1998
Networks, 1998
The plant location problem with demand-dependent setup costs and centralized allocation.
Eur. J. Oper. Res., 1998
1997
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective.
Discret. Appl. Math., 1997
1996
Transp. Sci., 1996
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree.
Transp. Sci., 1996
INFORMS J. Comput., 1996
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree.
Discret. Appl. Math., 1996
1995
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree.
Transp. Sci., 1995
1994
Transp. Sci., 1994
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms.
Math. Program., 1994