AN EX-POST BOUND ON THE GREEDY HEURISTIC FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM

摘要

A bound for the greedy heuristic applied to the K-facility location problem can be calculated, using values gathered during the calculation of the heuristic. The bound strengthens a well-known bound for the heuristic. Computational experiments show that this bound can be beneficial when the number of facilities is small or close to the total number of potential sites. In addition, it is consistent with previous results about the influence of the data characteristics upon the optimal value.