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]
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 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]
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]
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]
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]
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]
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]