A stopping rule for facilities location algorithms

Abstract

<p>The single facility location model with Euclidean distances and its multi-facility and ℓ_p distance generalizations are considered. With present algorithms a user is unable to decide how close to optimal any given feasible solution is. This article describes a procedure for calculating a lower bound on the optimal objective function when a proposed solution is given.</p>