An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem.

摘要

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 multifacility problems with l sub p distances is also given. (Author)