The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |