Abstract
The multi-facility location problem with rectilinear distances is considered. A necessary and sufficient optimality condition is stated and proved. An algorithm is developed and computational results are given. A new lower bound for multi-facility problems with lp distances is also given.