Abstract
We propose a polynomial-time algorithm for solving the generalized Weber problem in median metric spaces.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
J. Mowder and S. Elmaghrabi (eds.), Operations Research. Models and Application [Russian translation], Mir, Moscow (1981).
V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Optimization Problems in Production-Transportation Planning [in Russian], Nauka, Moscow (1986).
D. K. Zambitskii and D. D. Lozovanu, Algorithms to Solve Optimization Problems on Networks [in Russian], Shtiintsa, Kishinev (1983).
B. C. Tansel, R. L. Francis, and T. J. Lowe, “Location on networks: a survey. I, II,” Manage. Sci.,29, No. 4, 482–511 (1983).
A. Kolen, Location Problems on Trees and in the Rectilinear Plane, Stitchting Math. Centrum, Amsterdam (1982).
J. C. Picard and H. D. Ratliff, “A cut approach to the rectilinear distance location problems,” Oper. Res.,26, No. 3, 422–433 (1978).
V. A. Trubin, “An effective algorithm to solve the Weber problem with rectilinear metric,” Kibernetika, No. 6, 67–70 (1978).
D. K. Zambitskii and V. K. Sibirskii, “Effective algorithm to solve the Weber problem on a tree network,” Izv. Akad. Nauk MoldSSR, Ser. Fiz.-Tekh. Mat. Nauk, No. 2, 76–78 (1980).
H.-J. Bandelt and J.-P. Berthelemy, “Medians in median graphs,” Discr. Appl. Math.,12, No. 3, 407–414 (1984).
P. S. Soltan and V. D. Chepoi, “Solving Weber's problem for discrete median metric spaces,” Trudy Tbilis. Mat. Inst.,85, 52–76 (1987).
H-J. Bandelt, “Single facility location on median networks,” Preprint, Oldenburg Univ. (1987).
J.-P. Barthelemy, B. Leclerc, and B. Mongardet, “On the use of ordered sets in problems of comparison and consensus of classification,” J. Classif.,3, No. 2, 187–224 (1986).
S. P. Avann, “Metric ternary distributive semilattices,” Proc. Am. Math. Soc.,12, No. 3, 407–411 (1961).
H.-M. Mulder, “The interval function of a graph,” Math. Centre Tracts, Vol. 132 (1980).
T. T. Lebedeva, I. V. Sergienko, and V. P. Soltan, “On conditions of equality of local and global extrema in discrete optimization problems,” Kibernetika, No. 5, 58–65 (1984).
V. P. Soltan, An Introductino to Axiomatic Convexity Theory [in Russian], Shtiintsa, Kishenev (1984).
A. J. Goldman and C. J. Witzgall, “A localization problem for optimal facility placement,” Transp. Sci.,4, No. 3, 406–409 (1970).
A. W. Dress and R. Scharlau, “Gated sets in metric spaces,” Aequat. Math.,34, No. 1, 112–120 (1987).
D. Z. Djocovic, “Distance-preserving subgraphs of hypercubes,” J. Combin. Theory,B14, 263–267 (1973).
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ (1982).
Additional information
Translated from Kibernetika, No. 1, pp. 61–69, 93, January–February, 1991.
Rights and permissions
About this article
Cite this article
Chepoi, V.D. Generalized Weber problem for discrete median spaces. Cybern Syst Anal 27, 81–92 (1991). https://doi.org/10.1007/BF01068650
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068650