On a rational stopping rule for facilities location algorithms

In the multifacility location problem, a number of new facilities are to be located so as to minimize a sum of weighted distances. Recently, a lower bound on the optimal value was developed, for use in deciding when to stop an iterative solution procedure. We develop a stronger bound that allows some computational savings.     

A note on solving multifacility location problems involving euclidean distances

This note considers a recently proposed solution method for a multifacility location problem. It is shown that the method does not always produce an optimal solution.