Location problems with costs being sums of powers of euclidean distances. - Reuven Chen (Comput. Oper. Res., 1984)

Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space. - Reuven Chen (Transp. Sci., 1988)

Accelerating convergence in the Fermat-Weber location problem. - Jack Brimberg; Reuven Chen; Doron Chen (Oper. Res. Lett., 1998)

New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems. - Doron Chen; Reuven Chen (Comput. Oper. Res., 2009)

A relaxation-based algorithm for solving the conditional p-center problem. - Doron Chen; Reuven Chen (Oper. Res. Lett., 2010)

Noniterative Solution of Some Fermat-Weber Location Problems. - Reuven Chen (Adv. Oper. Res., 2011)

Optimal algorithms for the α-neighbor p-center problem. - Doron Chen; Reuven Chen (Eur. J. Oper. Res., 2013)