On Stopping Rules for Facilities Location Algorithms

Abstract

Two different lower bounds on the objective values of certain location problems have recently been proposed. Such bounds are useful for finite termination of an algorithm. It has been previously established that one of these bounds is superior to the other. Here we present some extensions and prove that a generalized version of the result is also true.