The maximal covering location problem is based on locatingp facilities in such a manner that coverage is maximized within set distance or time standards. This problem has been extended in a number of different ways where the main theme still involves locating a fixed number of facilities. In many applications site costs are not equal; this should cast doubt on the use of a constraint that fixes the number of facilities at a given number as compared to an approach that minimizes site costs and maximizes coverage. This paper addresses the use of site costs in a maximal covering location problem and presents several approaches to solutions, along with computational results. Theoretical linkages to other location models are also presented.