Averbakh Igor

Igor Averbakh

Information about the author Igor Averbakh will soon be added to the site.
Found 34 papers in total
Minimizing the makespan in multiserver network restoration problems
Minimizing the makespan in multiserver network restoration problems
2017
Suppose that a destroyed network needs to be restored by a number of servers...
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
2015
We consider facility location problems where the demand is continuously and uniformly...
Cooperative covering problems on networks
Cooperative covering problems on networks
2014
In this article, we consider the cooperative maximum covering location problem on a...
The Robust Set Covering Problem with interval data
The Robust Set Covering Problem with interval data
2013
We study the Set Covering Problem with uncertain costs. For each cost coefficient,...
Semi‐online two‐level supply chain scheduling problems
Semi‐online two‐level supply chain scheduling problems
2012
We consider two‐level supply chain scheduling problems where customers release...
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
2007
We consider a generalization of the uncapacitated facility location problem, where the...
The routing open-shop problem on a network: Complexity and approximation
The routing open-shop problem on a network: Complexity and approximation
2006
In the routing open-shop problem, jobs are located at nodes of an undirected...
The minmax relative regret median problem on networks
The minmax relative regret median problem on networks
2005
We consider a version of the 1-median problem on a network with uncertain weights of...
The minmax regret permutation flow-shop problem with two jobs
The minmax regret permutation flow-shop problem with two jobs
2006
We consider the makespan-minimizing permutation flow-shop problem with 2 jobs and m...
Project scheduling under competition
Project scheduling under competition
2005
We introduce and investigate the problem of scheduling activities of a project by a...
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
2005
In the routing open-shop problem, jobs are located at nodes of a transportation...
The competitive salesman problem on a network: a worst-case approach
The competitive salesman problem on a network: a worst-case approach
2006
We provide a complexity analysis of the problem of optimal routing of a server on a...
Minmax regret solutions for minimax optimization problems with uncertainty
Minmax regret solutions for minimax optimization problems with uncertainty
2000
We propose a general approach for finding minmax regret solutions for a class of...
On the complexity of minmax regret linear programming
On the complexity of minmax regret linear programming
2005
We consider linear programming problems with uncertain objective function...
Facility location problems with uncertainty on the plane
Facility location problems with uncertainty on the plane
2005
We consider single facility location problems (1-median and weighted 1-center) on a...
The m-machine flowshop problem with unit-time operations and intree precedence constraints
The m-machine flowshop problem with unit-time operations and intree precedence constraints
2005
We consider the flowshop problem with unit-time operations and intree precedence...
Minmax regret linear resource allocation problems
Minmax regret linear resource allocation problems
2004
For minmax regret versions of some basic resource allocation problems with linear cost...
An improved algorithm for the minmax regret median problem on a tree
An improved algorithm for the minmax regret median problem on a tree
2003
We consider the 1-median problem with uncertain weights for nodes. Specifically, for...
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
2002
The generic problem studied is to locate p distinguishable facilities on a tree to...
Minmax p-traveling salesmen location problems on a tree
Minmax p-traveling salesmen location problems on a tree
2002
Suppose that p traveling salesmen must visit together all points of a tree, and the...
Location problems with grouped structure of demand: Complexity and algorithms
Location problems with grouped structure of demand: Complexity and algorithms
1998
We study generalizations of classical multifacility location problems, where...
Minmax regret median location on a network under uncertainty
Minmax regret median location on a network under uncertainty
2000
We consider the 1-median problem on a network with uncertain weights of nodes....
Algorithms for the robust 1‐center problem on a tree
Algorithms for the robust 1‐center problem on a tree
2000
We consider the weighted 1‐center problem on a network with uncertainty in node...
A simple heuristic for m-machine flow-shop and its applications in routing–scheduling problems
A simple heuristic for m-machine flow-shop and its applications in routing–scheduling problems
1999
We consider the routing–scheduling version of the flow-shop problem, where n...
Papers per page: