Article ID: | iaor20125715 |
Volume: | 20 |
Issue: | 3 |
Start Page Number: | 639 |
End Page Number: | 660 |
Publication Date: | Oct 2012 |
Journal: | TOP |
Authors: | Pelegrn Blas, Surez-Vega Rafael, Cano Sal |
Keywords: | combinatorial optimization, networks, heuristics, programming: integer |
An isodistant point is any point on a network which is located at a predetermined distance from some node. For some competitive facility location problems on a network, it is verified that optimal (or near‐optimal) locations are found in the set of nodes and isodistant points (or points in the vicinity of isodistant points). While the nodes are known, the isodistant points have to be determined for each problem. Surprisingly, no algorithm has been proposed to generate the isodistant points on a network. In this paper, we present a variety of such problems and propose an algorithm to find all isodistant points for given threshold distances associated with the nodes. The number of isodistant points is upper bounded by