Abstract
Since the median approach is based on averaging, it often provides solutions where remote and low-population density areas are discriminated against in terms of accessibility to public facilities, as compared with centrally situated and high-population density areas. On the other hand, locating a facility at the centre may cause a large increase in total distance, thus generating a substantial loss in spacial efficiency. This has led to a search for some compromise solution concept. Halpern has introduced the λ-Centdian as a parametric solution concept based on the bicriteria center median model. He has modeled the corresponding trade-offs with a convex combination of the unweighted center and weighted median objectives. In this paper we study the λ-Centdian like a convex combination of the weighted center and weighted median objectives we called it generalized Centdian problem.
Similar content being viewed by others
References
Hakimi, S.L. (1964). Optimum Locations of Switching Center and the absolute Center and Medians of a Graph.Operations Research 12, 450–459.
Halpern, J. (1976). The location of a Centdian convex combination on an undirected tree.Journal of Regional Science 16, 237–245.
Halpern, J. (1978). Finding Minimal Center-Median Convex Combination (Centdian) of a Graph.Management Science 24, 535–544.
Halpern, J. (1980). Duality in the Cent-Dian of a Graph.Operations Research 28, 722–735.
Hansen, P., M. Labbe and J.F. Thisse (1991). From the median to the generalized center.Operation Research 15–1, 73–86.
Hooker, J.N., R.S. Garfinkel and C.K. Chen (1991). Finite Dominating Sets For Network Location Problems.Operation Research 39, 100–118.
Moreno Pérez, J.A. (1985). A Correction to the definition of Local Center.European Journal of Operational Research 20, 382–385.
Pérez-Brito, D., J.A. Moreno Pérez and I. Rodríguez-Martín (1997). Finite Dominating Set for thep-Facility Cent-dian Network Location problem.Studies in Location Analysis,Issue 11, 27–40.
Tamir, A., D. Pérez-Brito and J.A. Moreno Pérez (1998). A polynomial algorithm for thep-Centdian Problem on a tree.Networks 32–4, 255–262.
Author information
Authors and Affiliations
Additional information
This research has been partially supported by Gobierno de Canarias through projects PI1999/116.