Abstract
In this paper we examine the Uncapacitated Facility Location Problem (UFLP) with a special structure of the objective function coefficients. For each customer the set of potential locations can be partitioned into subsets such that the objective function coefficients in each are identical. This structure exists in many applications, including the Maximum Cover Location Problem. For the problems possessing this structure, we develop a new integer programming formulation that has all the desirable properties of the standard formulation, but with substantially smaller dimensionality, leading to significant improvement in computational times. While our formulation applies to any instance of the UFLP, the reduction in dimensionality depends on the degree to which this special structure is present.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berman, O. and D. Krass. (2002). “The Generalized Maximal Cover Location Problem.” Computers and Operations Research 29, 563–591.
Berman, O., Z. Drezner, and D. Krass. (2003). “The Gradual Covering Decay Location Problem on Networks.” EJOR 151, 474–480.
Church, R.L. and M.E. Meadows. (1979). “Location Modeling Utilizing Maximum Service Distance Criteria.” Geographical Analysis 11, 358–373.
Church, R.L. and C. ReVelle. (1974). “The Maximal Covering Location Problem.”Papers of Regional Science Association 32, 101–118.
Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.” Management Science 23(8), 789–810.
Cornuejols, M.L., G.L. Nemhauser, and L.A. Wolsey. (1990). “The Uncapacitated Facility Location Problem.” In R.L. Francis and P. Mirchandani (eds.), Discrete Location Theory New York: Wiley Interscience.
Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” Operations Research 26, 992–1009.
Galvão, R.D. (1980). “A Dual-Bounded Algorithm for the p-Median Problem.” Operations Research 28, 1112–1121.
Galvão, R.D. and L.A. Raggi. (1989). “A Method for Solving to Optimality Uncapacitated Location Problems.” Annals of Operations Research 18, 225–244.
Kolen, A. and A. Tamir. (1990) “Covering Problems.” In P. Mirchandani and R.L. Francis (eds.), Discrete Location Theory. Wiley, pp. 263–304.
Krarup, J. and P.M. Pruzan. (1983). “The Simple Plant Location Problem: Survey and Synthesis.” Europena Journal of Operational Research 12, 36–81.
Revelle, C. (1993). “Facility Siting and Integer-Friendly Programming.” European Journal of Operational Research 65, 147–159.
Zipkin, P. (1980). “Bounds for Row-Aggregations in Linear Programming.” Operations Research 28, 903–916.
Author information
Authors and Affiliations
Additional information
This work was supported by grants from NSERC.
Rights and permissions
About this article
Cite this article
Berman, O., Krass, D. An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure. Ann Oper Res 136, 21–34 (2005). https://doi.org/10.1007/s10479-005-2036-2
Issue Date:
DOI: https://doi.org/10.1007/s10479-005-2036-2