 Note--On the Maximal Covering Location Problem and the Generalized Assignment ProblemT. D. Klastorin
Management Science, 1979, vol. 25, issue 1, 107-112 Abstract: In many public sector location problems, it is often desirable to locate facilities in such a way to minimize the number (or cost) of facilities while insuring tint all demand centers are within a stated maximal service time front any facility. However, when insufficient resources exist to allow die construction of enough facilities to serve all demand centers within the alloted time, the location problem is frequently restated in order to locate the budgeted facilities to serve the serviced population. Problems of the latter type are generally known as maximal covering location problems, which may have a number of extensions, including mandatory closeness constraints which place an upper bound on the maximal service time requirement for the entire population. This note demonstrates how this class of frequently encountered problems can be formulated as generalized assignment problems within the conceptual framework presented by Ross and Soland (Ross, G. T., R. Soland. 1977. Modeling facility location problems as generalized assignment problems. Management Sci. 24 (3, November) 345-357.) for other discrete public and private location problems. Keywords: facility location; assignment problem (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:1:p:107-112 Access Statistics for this article More articles in Management Science from INFORMS Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.