Abstract
In this paper, we use a pseudo-Boolean formulation of the p-median problem and using data aggregation, provide a compact representation of p-median problem instances. We provide computational results to demonstrate this compactification in benchmark instances. We then use our representation to explain why some p-median problem instances are more difficult to solve to optimality than other instances of the same size. We also derive a preprocessing rule based on our formulation, and describe equivalent p-median problem instances, which are identical sized instances which are guaranteed to have identical optimal solutions.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
AlBdaiwi BF, Goldengorin B, Sierksma G (2009) Equivalent instances of the simple plant location problem. Comput Math Appl 57:812–820
Avella P, Sforya A (1999) Logical reduction tests for the p-median problem. Ann Oper Res 86:105–115
Avella P, Sassano A, Vasil’ev I (2007) Computational study of large-scale p-median problems. Math Program Ser A 109:89–114
Beresnev VL (1973) On a problem of mathematical standardization theory. Upr Sist 11:43–54 (in Russian)
Boros E, Hammer PL (2002) Pseudo-Boolean optimization. Discrete Appl Math 123:155–225
Briant O, Naddef D (2004) The optimal diversity management problem. Oper Res 52:515–526
Burkard RE, Kliny B, Rudolf R (1996) Perspective of Monge properties. Discrete Appl Math 70:95–161
Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60:193–215
Goldengorin B, Ghosh D, Sierksma G (2003a) Branch and peg algorithms for the simple plant location problem. Comput Oper Res 30:967–981
Goldengorin B, Tijssen GA, Ghosh D, Sierksma G (2003b) Solving the simple plant location problems using a data correcting approach. J Glob Optim 25:377–406
Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459
Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462–475
Hammer PL (1968) Plant location—a pseudo-Boolean approach. Isr J Technol 6:330–332
Kariv O, Hakimi L (1979) An algorithmic approach to network location problems, part II: The p-medians. SIAM J Appl Math 37:539–560
Khumawala BM (1972) An efficient branch-and-bound algorithm for the warehouse location problem. Manag Sci 18:718–731
Krarup J, Vajda S (1997) On Torricelli’s geometrical solution to a problem of Fermat. IMA J Math Appl Bus Ind 8:215–224
Mirkin B (2005) Clustering for data mining: a data recovery approach. Chapman & Hall/CRC computer science. Chapman & Hall/CRC, London
Mladenovic N, Brimberg J, Hansen P, Moreno-Peréy JA (2007) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179:927–939
Reese J (2006) Solution methods for the p-median problem: an annotated bibliography. Networks 48:125–142
Revelle CS, Eiselt HA, Daskin MS (2008) A bibliography for some fundamental problem categories in discrete location science. Eur J Oper Res 184:817–848
Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin
Weber A (1909) Über den Standort der Industrien, Erster Teil: Reine Theorie des Standortes. Mohr, Tübingen
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
AlBdaiwi, B.F., Ghosh, D. & Goldengorin, B. Data aggregation for p-median problems. J Comb Optim 21, 348–363 (2011). https://doi.org/10.1007/s10878-009-9251-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9251-8