Abstract
A convergent cutting plane algorithm is developed for the rectilinear distance location-allocation problem which is basically a nonconvex problem. The method is illustrated by a numerical example. Computational times are given both for small and large sized problems, and are compared with results reported in the literature.