The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Igor Averbakh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Igor Averbakh, Oded Berman, Ilya Chernykh
    The m-machine flowshop problem with unit-time operations and intree precedence constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:263-266 [Journal]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002