The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Oded Berman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zvi Adar, Niv Ahituv, Oded Berman
    The value of an information system for service networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1985, v:12, n:1, pp:71-85 [Journal]
  2. 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]
  3. Oded Berman
    Repositioning of distinguishable urban service units on networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1981, v:8, n:2, pp:105-118 [Journal]
  4. Oded Berman, Michal Cutler
    Resource allocation during tests for optimally reliable software. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2004, v:31, n:11, pp:1847-1865 [Journal]
  5. Oded Berman, Michal Cutler
    Optimal software implementation considering reliability and cost. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1998, v:25, n:10, pp:857-868 [Journal]
  6. Oded Berman, Zvi Drezner, George O. Wesolowsky
    Locating service facilities whose reliability is distance dependent. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:11, pp:1683-1695 [Journal]
  7. Oded Berman, Dmitry Krass
    The generalized maximal covering location problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:6, pp:563-581 [Journal]
  8. Oded Berman, U. Dinesh Kumar
    Optimization models for complex recovery block schemes. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:5, pp:525-544 [Journal]
  9. Oded Berman, Richard C. Larson
    A queueing control model for retail services having back room operations and cross-trained workers. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2004, v:31, n:2, pp:201-222 [Journal]
  10. Oded Berman, K. P. Sapna
    Optimal control of service for facilities holding inventory. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2001, v:28, n:5, pp:429-441 [Journal]
  11. Oded Berman, Vedat Verter, Bahar Yetis Kara
    Designing emergency response networks for hazardous materials transportation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:5, pp:1374-1388 [Journal]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Oded Berman, Zvi Drezner, George O. Wesolowsky
    Minimum covering criterion for obnoxious facility location on a network. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:1, pp:1-5 [Journal]
  20. Oded Berman, Jiamin Wang
    Probabilistic location problems with discrete demand weights. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:1, pp:47-57 [Journal]
  21. 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]
  22. Oded Berman, Noushin Ashrafi
    Optimization Models for Reliability of Modular Software Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1993, v:19, n:11, pp:1119-1123 [Journal]
  23. Oded Berman, Sandeep Vasudeva
    Approximating performance measures for public services. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part A, 2005, v:35, n:4, pp:583-591 [Journal]
  24. Oded Berman, David Perry
    An EOQ model with state-dependent demand rate. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:171, n:1, pp:255-272 [Journal]
  25. 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]
  26. Oded Berman, Arieh Gavious
    Location of terror response facilities: A game between state and terrorist. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:2, pp:1113-1133 [Journal]
  27. Rajan Batta, Oded Berman, Qian Wang
    Balancing staffing and switching costs in a service center with flexible servers. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:2, pp:924-938 [Journal]
  28. 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]
  29. Oded Berman, Zvi Drezner, George O. Wesolowsky
    The transfer point location problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:179, n:3, pp:978-989 [Journal]
  30. Robert Aboolian, Oded Berman, Dmitry Krass
    Competitive facility location model with concave demand. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:2, pp:598-619 [Journal]
  31. Robert Aboolian, Oded Berman, Dmitry Krass
    Competitive facility location and design problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:182, n:1, pp:40-62 [Journal]
  32. 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]
  33. Oded Berman, Jiamin Wang, K. P. Sapna
    Optimal management of cross-trained workers in services with negligible switching costs. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:167, n:2, pp:349-369 [Journal]
  34. Oded Berman, Dmitry Krass, Zvi Drezner
    The gradual covering decay location problem on a network. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:3, pp:474-480 [Journal]

  35. Locating a semi-obnoxious facility with expropriation. [Citation Graph (, )][DBLP]


  36. The minimum weighted covering location problem with distance constraints. [Citation Graph (, )][DBLP]


  37. The network p-median problem with discrete probabilistic demand weights. [Citation Graph (, )][DBLP]


  38. Generalized coverage: New developments in covering location models. [Citation Graph (, )][DBLP]


  39. The Ordered Gradual Covering Location Problem on a Network. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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