A Probabilistic Minimax Location Problem on the Plane. - Oded Berman; Jiamin Wang 002; Zvi Drezner; George O. Wesolowsky (Ann. Oper. Res., 2003)

Probabilistic location problems with discrete demand weights. - Oded Berman; Jiamin Wang 002 (Networks, 2004)

Optimal management of cross-trained workers in services with negligible switching costs. - Oded Berman; Jiamin Wang 002; K. P. Sapna (Eur. J. Oper. Res., 2005)

The 1-minimax and 1-maximin problems with demand weights of general probability distributions. - Oded Berman; Jiamin Wang 002 (Networks, 2007)

The network p-median problem with discrete probabilistic demand weights. - Oded Berman; Jiamin Wang 002 (Comput. Oper. Res., 2010)

The probabilistic gradual covering location problem on a network with discrete random demand weights. - Oded Berman; Dmitry Krass; Jiamin Wang 002 (Comput. Oper. Res., 2011)

The minmax regret gradual covering location problem on a network with incomplete information of demand weights. - Oded Berman; Jiamin Wang 002 (Eur. J. Oper. Res., 2011)

The multifacility center problems with random demand weights. - Oded Berman; Jiamin Wang 002 (Networks, 2022)