Igor Averbakh

发表

Stationary analysis of a single server retrial queue with priority and vacation

Oded Berman, D. Arivudainambi, Igor Averbakh, 2009 .

Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems pdf

Igor Averbakh, Jordi Pereira, 2020, ArXiv.

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

Oded Berman, Igor Averbakh, 1994, Transp. Sci..

Minmax regret linear resource allocation problems

Igor Averbakh, 2004, Oper. Res. Lett..

Batching and delivery in semi-online distribution systems

Igor Averbakh, Mehmet Baysan, I. Averbakh, 2013, Discret. Appl. Math..

The minmax regret permutation flow-shop problem with two jobs

Igor Averbakh, 2006, Eur. J. Oper. Res..

Robust univariate spline models for interpolating interval data

Yun-Bin Zhao, Igor Averbakh, 2011, Oper. Res. Lett..

Emergency path restoration problems

Igor Averbakh, I. Averbakh, 2012, Discret. Optim..

Minmax p-Traveling Salesmen Location Problems on a Tree

Oded Berman, Igor Averbakh, I. Averbakh, 2002, Ann. Oper. Res..

Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two

Sandi Klavzar, Zhendong Shao, Igor Averbakh, 2015, Comput. J..

Exact and heuristic algorithms for the interval data robust assignment problem

Igor Averbakh, Jordi Pereira, J. Pereira, 2011, Comput. Oper. Res..

Minisum multipurpose trip location problem on trees

Oded Berman, Igor Averbakh, Mojtaba Araghi, 2014, Networks.

Project scheduling under competition

Igor Averbakh, Vasilij Lebedev, I. Averbakh, 2005 .

Computing and minimizing the relative regret in combinatorial optimization with interval data

Igor Averbakh, 2005, Discret. Optim..

Minmax Regret Median Location on a Network Under Uncertainty

Oded Berman, Igor Averbakh, I. Averbakh, 2000, INFORMS J. Comput..

Parallel Complexity of Additive Location Problems

Oded Berman, Igor Averbakh, 1999, INFORMS J. Comput..

Probabilistic a priori routing‐location problems

David Simchi-Levi, Oded Berman, Igor Averbakh, 1994 .

A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree

Oded Berman, Igor Averbakh, I. Averbakh, 1996, Discret. Appl. Math..

Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Igor Averbakh, I. Averbakh, 2010, Discret. Optim..

Minimizing the makespan in multiserver network restoration problems

Igor Averbakh, 2017, Networks.

Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths

Igor Averbakh, I. Averbakh, 2003, Discret. Appl. Math..

The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows

Igor Averbakh, Mohammad Javad Feizollahi, I. Averbakh, 2014, INFORMS J. Comput..

Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand

Oded Berman, Dmitry Krass, Jörg Kalcsics, 2015, Oper. Res..

Facility location problems with uncertainty on the plane

Sergey Bereg, Igor Averbakh, I. Averbakh, 2005, Discret. Optim..

The competitive salesman problem on a network: a worst-case approach

Igor Averbakh, Vasilij Lebedev, 2006, Oper. Res. Lett..

The Minmax Relative Regret Median Problem on Networks

Igor Averbakh, 2005, INFORMS J. Comput..

On the complexity of minmax regret linear programming

Igor Averbakh, Vasilij Lebedev, I. Averbakh, 2005, Eur. J. Oper. Res..

Lateness Minimization in Pairwise Connectivity Restoration Problems

Igor Averbakh, Jordi Pereira, 2018, INFORMS J. Comput..

Parallel NC‐algorithms for multifacility location problems with mutual communication and their applications

Oded Berman, Igor Averbakh, I. Averbakh, 2002, Networks.

The L(j, k)-Edge-Labeling Problem on Graphs

Zhendong Shao, Igor Averbakh, 2018, Ars Comb..

Constrained Matroidal Bottleneck Problems

Abraham P. Punnen, Oded Berman, Igor Averbakh, 1995, Discret. Appl. Math..

On-line supply chain scheduling problems with preemption

Igor Averbakh, Zhihui Xue, I. Averbakh, 2007, Eur. J. Oper. Res..

Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights

Oded Berman, Igor Averbakh, Marina Leal, 2018, Discret. Appl. Math..

Location problems with grouped structure of demand: Complexity and algorithms

Oded Berman, Igor Averbakh, 1998, Networks.

Semi-online two-level supply chain scheduling problems

Igor Averbakh, Mehmet Baysan, I. Averbakh, 2012, J. Sched..

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

Igor Averbakh, I. Averbakh, 2001, Math. Program..

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network

Oded Berman, Igor Averbakh, Ilya Chernykh, 2005, Eur. J. Oper. Res..

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

Oded Berman, Igor Averbakh, Ilya Chernykh, 2006, Eur. J. Oper. Res..

Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints

Oded Berman, Igor Averbakh, 1996, INFORMS J. Comput..

Minmax regret solutions for minimax optimization problems with uncertainty

Igor Averbakh, 2000, Oper. Res. Lett..

Algorithms for the robust 1-center problem on a tree

Oded Berman, Igor Averbakh, 2000, Eur. J. Oper. Res..

Cooperative covering problems on networks

Oded Berman, Dmitry Krass, Stefan Nickel, 2014, Networks.

The plant location problem with demand-dependent setup costs and centralized allocation

Zvi Drezner, George O. Wesolowsky, Oded Berman, 1998, Eur. J. Oper. Res..

Routing Two-Machine Flowshop Problems on Networks with Special Structure

Oded Berman, Igor Averbakh, 1996, Transp. Sci..

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

Igor Averbakh, I. Averbakh, 2010, Eur. J. Oper. Res..

Multi-depot traveling salesmen location problems on networks with special structure

Wei Yu, Igor Averbakh, 2020, Ann. Oper. Res..

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

Igor Averbakh, Vasilij Lebedev, I. Averbakh, 2006, Discret. Appl. Math..

Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets

Yun-Bin Zhao, Igor Averbakh, 2008, SIAM J. Optim..

An improved algorithm for the minmax regret median problem on a tree

Oded Berman, Igor Averbakh, 2003, Networks.

Interval data minmax regret network optimization problems

Igor Averbakh, Vasilij Lebedev, I. Averbakh, 2004, Discret. Appl. Math..

Network construction problems with due dates

Igor Averbakh, Jordi Pereira, 2015, Eur. J. Oper. Res..

A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

Oded Berman, Igor Averbakh, I. Averbakh, 1999, Oper. Res..

Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms

Igor Averbakh, 1994, Math. Program..

Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree

Oded Berman, Igor Averbakh, 1995, Transp. Sci..

L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs

Roberto Solis-Oba, Zhendong Shao, Igor Averbakh, 2017, Discret. Appl. Math..

(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective

Oded Berman, Igor Averbakh, I. Averbakh, 1997, Discret. Appl. Math..

Algorithms for path medi-centers of a tree

Oded Berman, Igor Averbakh, I. Averbakh, 1999, Comput. Oper. Res..

Categorized bottleneck-minisum path problems on networks

Oded Berman, Igor Averbakh, I. Averbakh, 1994, Oper. Res. Lett..

Relaxed robust second-order-cone programming

Yun-Bin Zhao, Igor Averbakh, 2009, Appl. Math. Comput..

The Robust Set Covering Problem with interval data

Igor Averbakh, Jordi Pereira, J. Pereira, 2013, Ann. Oper. Res..

The m-machine flowshop problem with unit-time operations and intree precedence constraints

Oded Berman, Igor Averbakh, Ilya Chernykh, 2005, Oper. Res. Lett..

The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation

Zvi Drezner, George O. Wesolowsky, Oded Berman, 2007, Eur. J. Oper. Res..

Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem

Igor Averbakh, Mehmet Baysan, 2013, Oper. Res. Lett..

Nash equilibria in competitive project scheduling

Igor Averbakh, I. Averbakh, 2010, Eur. J. Oper. Res..

Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree

Oded Berman, Igor Averbakh, 1996, Transp. Sci..

Sales-delivery man problems on treelike networks

Oded Berman, Igor Averbakh, 1995, Networks.

The pairwise flowtime network construction problem

Igor Averbakh, 2021, Oper. Res. Lett..

Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams

Oded Berman, Dmitry Krass, Jörg Kalcsics, 2021, Discret. Appl. Math..

Minimizing the total weighted pairwise connection time in network construction problems pdf

Igor Averbakh, I. Averbakh, 2021, ArXiv.

Robust univariate cubic $L_2$ splines:Interpolating data with uncertain positions of measurements

Shu-Cherng Fang, Yun-Bin Zhao, Igor Averbakh, 2009 .

An iterative method of solving two-stage discrete stochastic programming problems with additively separable variables

Igor Averbakh, I. Averbakh, 1992 .