Theoretical and Computational Links between the p‐Median, Location Set‐covering, and the Maximal Covering Location Problem

It has been shown that the p‐median problem, the location set‐covering and the maximal covering location problems are important facility location models. This paper gives a historical perspective of the development of these models and identifies the theoretical links between them. It is shown that the maximal covering location problem can be structured and solved as a p‐median problem in addition to the several approaches already developed. Computational experience for several maximal covering location problems is given.