dblp.uni-trier.dewww.uni-trier.de

Igor Averbakh

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2007
26EEIgor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky: The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation. European Journal of Operational Research 179(3): 956-967 (2007)
25EEIgor Averbakh, Zhihui Xue: On-line supply chain scheduling problems with preemption. European Journal of Operational Research 181(1): 500-504 (2007)
2006
24EEVasilij Lebedev, Igor Averbakh: Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discrete Applied Mathematics 154(15): 2167-2177 (2006)
23EEIgor Averbakh: The minmax regret permutation flow-shop problem with two jobs. European Journal of Operational Research 169(3): 761-766 (2006)
22EEIgor Averbakh, Oded Berman, Ilya Chernykh: The routing open-shop problem on a network: Complexity and approximation. European Journal of Operational Research 173(2): 531-539 (2006)
21EEIgor Averbakh, Vasilij Lebedev: The competitive salesman problem on a network: a worst-case approach. Oper. Res. Lett. 34(2): 165-174 (2006)
2005
20EEIgor Averbakh, Sergey Bereg: Facility location problems with uncertainty on the plane. Discrete Optimization 2(1): 3-34 (2005)
19EEIgor Averbakh: Computing and minimizing the relative regret in combinatorial optimization with interval data. Discrete Optimization 2(4): 273-287 (2005)
18EEIgor Averbakh, Vasilij Lebedev: On the complexity of minmax regret linear programming. European Journal of Operational Research 160(1): 227-231 (2005)
17EEIgor Averbakh, Oded Berman, Ilya Chernykh: A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. European Journal of Operational Research 166(1): 3-24 (2005)
16EEIgor Averbakh: The Minmax Relative Regret Median Problem on Networks. INFORMS Journal on Computing 17(4): 451-461 (2005)
15EEIgor Averbakh, Oded Berman, Ilya Chernykh: The m-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33(3): 263-266 (2005)
2004
14EEIgor Averbakh, Vasilij Lebedev: Interval data minmax regret network optimization problems. Discrete Applied Mathematics 138(3): 289-301 (2004)
13EEIgor Averbakh: Minmax regret linear resource allocation problems. Oper. Res. Lett. 32(2): 174-180 (2004)
2003
12EEIgor Averbakh: Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths. Discrete Applied Mathematics 127(3): 505-522 (2003)
11EEIgor Averbakh, Oded Berman: An improved algorithm for the minmax regret median problem on a tree. Networks 41(2): 97-103 (2003)
2002
10EEIgor Averbakh, Oded Berman: Minmax p-Traveling Salesmen Location Problems on a Tree. Annals OR 110(1-4): 55-68 (2002)
9EEIgor Averbakh, Oded Berman: Parallel NC-algorithms for multifacility location problems with mutual communication and their applications. Networks 40(1): 1-12 (2002)
2000
8EEIgor Averbakh, Oded Berman: Minmax Regret Median Location on a Network Under Uncertainty. INFORMS Journal on Computing 12(2): 104-110 (2000)
7EEIgor Averbakh: Minmax regret solutions for minimax optimization problems with uncertainty. Oper. Res. Lett. 27(2): 57-65 (2000)
1999
6EEIgor Averbakh, Oded Berman: Algorithms for path medi-centers of a tree. Computers & OR 26(14): 1395-1409 (1999)
1998
5EEIgor Averbakh, Oded Berman: Location problems with grouped structure of demand: Complexity and algorithms. Networks 31(2): 81-92 (1998)
1997
4EEIgor Averbakh, Oded Berman: (p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. Discrete Applied Mathematics 75(3): 201-216 (1997)
1996
3EEIgor Averbakh, Oded Berman: A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. Discrete Applied Mathematics 68(1-2): 17-32 (1996)
1995
2EEIgor Averbakh, Oded Berman, Abraham P. Punnen: Constrained Matroidal Bottleneck Problems. Discrete Applied Mathematics 63(3): 201-214 (1995)
1994
1 Igor Averbakh: Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. Math. Program. 65: 311-330 (1994)

Coauthor Index

1Sergey Bereg (Sergei Bespamyatnikh) [20]
2Oded Berman [2] [3] [4] [5] [6] [8] [9] [10] [11] [15] [17] [22] [26]
3Ilya Chernykh [15] [17] [22]
4Zvi Drezner [26]
5Vasilij Lebedev [14] [18] [21] [24]
6Abraham P. Punnen [2]
7George O. Wesolowsky [26]
8Zhihui Xue [25]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)