Abstract
In this paper we deal with the ordered median problem: a family of location problems that allows us to deal with a large number of real situations which does not fit into the standard models of location analysis. Moreover, this family includes as particular instances many of the classical location models. Here, we analyze thep-facility version of this problem on networks and our goal is to study the structure of the set of candidate points to be optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boland N., Domíguez-Marín P., Nickel S. and Puerto J. (2003). Exact Procedures for Solving the Discrete Ordered Median Problem.Berichte des Fraunhofer ITWN 47 (Computers and Operations Research, to appear).
Ball M.O., Magnanti T.L., Monma C.L. and Nemhauser G.L. (1995).Network Models. Handbooks in Operations Research and Management Science. North-Holland.
Daskin M.S. (1995).Network and Discrete Location. Models, Algorithms and Applications. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley.
Domíguez-Marín P., Hansen P., MladenoviĆ N. and Nickel S. (2003). Heuristic Procedures for Solving the Discrete Ordered Median Problem.Berichte des Fraunhofer ITWN, 46.
Drezner Z. and Hamacher H.W., editors. (2002).Facility Location. Aplications and Theory. Springer Verlag.
Drezner Z. (1995).Facility Location: A Survey of Applications and Methods. Springer Series in Operations Research. Springer Verlag.
Francis R.L., Lowe T.J. and Tamir A. (2000). Aggregation Error Bounds for a Class of Location Models.Operations Research 48, 294–307.
Hakimi S.L. (1964). Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph.Operations Research 12, 450–459.
Hooker J.N., Garfinkel R.S. and Chen C.K. (1991). Finite Dominating Sets for Network Location Problems.Operations Research 39, 100–118.
Handler G.Y. and Mirchandani P.B. (1979).Location on Networks Theory and Algorithms. The MIT Press.
Kalcsics J., Nickel S. and Puerto J.. (2003). Multifacility Ordered Median Problems on Networks: A Further Analysis.Networks 41, 1–12.
Kalcsics J., Nickel S., Puerto J. and Tamir A. (2002). Algorithmic Results for Ordered Median Problems.Operations Research Letters 30, 149–158.
Lozano A. J., Mesa J.A. and Plastria F. (2002). El Problema del Anti-k-Centrum en Grafos. Actas III Jornadas de Matemática Discreta y Algorítmica, 2002.
Mirchandani P.B. and Francis R.L., editors. (1990)Discrete Location Theory. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley.
Nickel S. and Puerto J. (1999). A Unified Approach to Network Location Problems.Networks 34, 283–290.
Ogryczak W. (1999). On the Distribution Approach to Location Problems.Computers and Industrial Engineering 37, 595–612.
Puerto J. and Fernández F.R. (1995). The Symmetrical Single Facility Location Problem. Technical Report, Facultad de Matemáticas. Universidad de Sevilla.
Puerto J. and Fernández F.R. (2000). Geometrical Properties of the Symmetrical Single Facility Location Problem.Journal of Nonlinear and Convex Analysis 1, 321–342.
Puerto J., Rodríguez-Chía A.M. and Fernández-Palacín F. (1997). Ordered Weber problems with Attraction and Repulsion.Studies in Locational Analysis 11, 127–141.
Rodríguez-Chía A.M. (1998). Advances on the Continuous Single Facility Location Problem. PhD Thesis, University of Seville, Spain.
Rodríguez-Chía A.M., Nickel S., Puerto J. and Fernández F.R. (2000). A Flexible Approach to Location Problems.Mathematical Methods Operations Research 51, 69–89.
Saameño J.J., Muñoz J. and Mérida E. (2003). A General Model for Undesirable Facility Location in Polygonal Regions. Preprint.
Author information
Authors and Affiliations
Additional information
The research of the authors is partially financed by Spanish research grants BFM2001-2378, BFM2001-4028, BFM2004-0909 and HA2003-0121.
Rights and permissions
About this article
Cite this article
Rodríguez-Chía, A.M., Puerto, J., Pérez-Brito, D. et al. Thep-facility ordered median problem on networks. Top 13, 105–126 (2005). https://doi.org/10.1007/BF02578990
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02578990