On the Continuous Fermat-Weber Problem

References

• Agarwal P. K., Sharir M., Welzl E. The discrete 2-center problem. Discrete Comput. Geom. (2000) 20:287–305Crossref, Google Scholar
• Aneja Y. P., Parlar M. Algorithms for Weber facility location in the presence of forbidden regions and/or barriers to travel. Transportation Sci. (1994) 28(1):70–76Link, Google Scholar
• Bajaj C. The algebraic degree of geometric optimization problems. Discrete Comput. Geom. (1988) 3:177–191Crossref, Google Scholar
• Balaban I. J. An optimal algorithm for finding segment intersections. Proc. 11th Annual ACM Symposium Comput. Geom. (1995) 211–219Crossref, Google Scholar
• Batta R., Ghose A., Palekar U. S. Locating facilities on the Manhattan metric with arbitrarily shaped barriers and convex forbidden regions. Transportation Sci. (1989) 23(1):26–36Link, Google Scholar
• Brandeau M. L., Chiu S. S. An overview of representative problems in location research. Management Sci. (1989) 35(6):645–674Link, Google Scholar
• Carrizosa E., Muñoz-Márquez M., Puerto J. Location and shape of a rectangular facility in ℜ2, convexity properties. Math. Programming (1998a) 83:277–290Crossref, Google Scholar
• Carrizosa E., Muñoz-Márquez M., Puerto J. The Weber problem with regional demand. Eur. J. Oper. Res. (1998b) 104:358–365Crossref, Google Scholar
• Chan T. M. More planar two-center algorithms. Comput. Geom. Theory Appl. (1999) 13:189–198Crossref, Google Scholar
• Chandrasekaran R., Tamir A. Algebraic optimization: The Fermat-Weber location problem. Math. Programming (1990) 46(2):219–224Crossref, Google Scholar
• Chazelle B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. (1991) 6:485–524Crossref, Google Scholar
• Chazelle B., Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane. J. ACM (1992) 39(1):1–54Crossref, Google Scholar
• Chen R., Handler G. Y. The conditional p-center problem in the plane. Naval Res. Logist. (1993) 40:117–127Crossref, Google Scholar
• Chepoi V. A multifacility location problem on median spaces. Discrete Appl. Math. (1996) 64:1–29Crossref, Google Scholar
• Chiang Y.-J., Mitchell J. S. B. Two-point Euclidean shortest path queries in the plane. Proc. 10th ACM-SIAM Sympos. Discrete Algorithms (1999) 215–224Google Scholar
• Choi J., Shin C.-S., Kim K. Computing weighted rectilinear median and center set in the presence of obstacles. Ninth Annual International Symposium on Algorithms and Computation (1998) 1533(Springer-Verlag, New York) 29–38Lecture Notes in Computer ScienceCrossref, Google Scholar
• Drezner Z. On the rectangular p-center problem. Naval Res. Logist. Quart. (1987) 34:229–234Crossref, Google Scholar
• Drezner Z.Facility Location: A Survey of Applications and Methods (1995a) (Springer Series in Operations Research. Springer-Verlag, New York) Crossref, Google Scholar
• Drezner Z. Replacing discrete demand with continuous demand. Facility Location: A Survey of Applications and Methods (1995b) (Springer-Verlag, New York) . Springer Series in Operations Research, Chapter 2Crossref, Google Scholar
• Drezner Z., Wesolowsky G. O. Optimal location of a facility relative to area demands. Naval Res. Logist. Quart. (1980) 27:199–206Crossref, Google Scholar
• Durier R., Michelot C. On the set of optimal points to the Weber problem: Further results. Transportation Sci. (1994) 28(2):141–149Link, Google Scholar
• Eppstein D. Faster construction of planar two-centers. Proc. 8th ACM-SIAM Sympos. Discrete Algorithms (1997) New Orleans, LA:131–138Google Scholar
• Fekete S. P., Meijer H. On minimum stars and maximum matchings. Discrete Comput. Geom. (2000) 23:389–407Crossref, Google Scholar
• Fekete S. P., Meijer H. The one-round Voronoi game replayed. Proc. 8th Workshop Algorithms Data Struct. Lecture Notes in Comput. Sci. (2003) 2748(Springer-Verlag, Ottawa, Ontario, Canada) 150–161Crossref, Google Scholar
• Fekete S. P., Mitchell J. S. B., Weinbrecht K. On the continuous Weber and k-median problems. Proc. 16th Annual ACM Symp. Comput. Geom. (2000) 70–79Google Scholar
• Goldman A. J. Optimal center location in simple networks. Transportation Sci. (1971) 5:240–255Link, Google Scholar
• Hamacher H. W., Nickel S. Classification of location problems. Location Sci. (1998) 6:229–242Crossref, Google Scholar
• Hershberger J. A faster algorithm for the two-center decision problem. Inform. Process. Lett. (1993) 47:23–29Crossref, Google Scholar
• Hershberger J., Suri S. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. (1999) 28:2215–2256Crossref, Google Scholar
• Hochbaum D. S., Shmoys D. A best possible heuristic for the k-center problem. Math. Oper. Res. (1985) 10:180–184Link, Google Scholar
• Hua L. K. Applications of mathematical methods for wheat harvesting. Chinese Math. (1962) 2:77–91Google Scholar
• Hwang R. Z., Lee R. C. T., Chang R. C. The slab dividing approach to solve the Euclidean p-center problem. Algorithmica (1993) 9:1–22Crossref, Google Scholar
• Kariv O., Hakimi S. L. An algorithmic approach to network location problems. I: The p-centers. SIAM J. Appl. Math. (1979) 37:513–538Crossref, Google Scholar
• Khuller S., Sussmann Y. J. The capacitated k-center problem. SIAM J. Discrete Math. (2000) 13(3):403–418Crossref, Google Scholar
• Ko M. T., Ching Y. T. Linear time algorithms for the weighted tailored 2-partition problem and the weighted rectilinear 2-center problem under L∞-distance. Discrete Appl. Math. (1992) 40:397–410Crossref, Google Scholar
• Ko M. T., Lee R. C. T., Chang J. S. An optimal approximation algorithm for the rectilinear m-center problem. Algorithmica (1990) 5:341–352Crossref, Google Scholar
• Kolen A. Equivalence between the direct search approach and the cut approach to the rectilinear distance location problem. Oper. Res. (1981) 29(3):616–620Link, Google Scholar
• Kusakari Y., Nishizeki T. Finding a region with the minimum total L1 distance from prescribed terminals. Algorithmica (2003) 35:225–256Crossref, Google Scholar
• Larson R. C., Sadiq G. Facility locations with the Manhattan metric in the presence of barriers to travel. Oper. Res. (1983) 31(4):652–669Link, Google Scholar
• Lichtenstein D. Planar formulae and their uses. SIAM J. Comput. (1982) 11(2):329–343Crossref, Google Scholar
• Love R. F., Morris J. G., Wesolowsky G. O.Facilities Location: Models & Methods (1988) (North Hollandde Gruyter, New York) Google Scholar
• Megiddo N. The weighted Euclidean 1-center problem. Math. Oper. Res. (1983) 8(4):498–504Link, Google Scholar
• Megiddo N., Tamir A. New results on the complexity of p-center problems. SIAM J. Comput. (1983) 12:751–758Crossref, Google Scholar
• Megiddo N., Zemel E. A randomized O(n log n) algorithm for the weighted Euclidean 1-center problem. J. Algorithms (1986) 7:358–368Crossref, Google Scholar
• Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (Wiley, New York) Google Scholar
• Mitchell J. S. B. An optimal algorithm for shortest rectilinear paths among obstacles. Abstracts 1st Canadian Conf. Comput. Geom. (1989) 22Google Scholar
• Mitchell J. S. B. A new algorithm for shortest paths among obstacles in the plane. Ann. Math. Artificial Intell. (1991) 3:83–106Crossref, Google Scholar
• Mitchell J. S. B. L1 shortest paths among polygonal obstacles in the plane. Algorithmica (1992) 8:55–88Crossref, Google Scholar
• Mitchell J. S. B., Goodman J. E., O'Rourke J. Shortest paths and networks. Handbook of Discrete and Computational Geometry (1997) (CRC Press LLC, Boca Raton, FL) 445–466Google Scholar
• Mitchell J. S. B., Sack J.-R., Urrutia J. Geometric shortest paths and network optimization. Handbook of Computational Geometry (2000) (Elsevier Science Publishers B.V., North-Holland, Amsterdam, The Netherlands) 633–701Crossref, Google Scholar
• Papadimitriou C. Worst case and probabilistic analysis of a geometric location problem. SIAM J. Comput. (1981) 3:542–557Crossref, Google Scholar
• Plastria F., Drezner Z. Continuous location problems. Facility Location: A Survey of Applications and Methods (1995) (Springer-Verlag, New York) . Springer Series in Operations Research, Chapter 11Crossref, Google Scholar
• Pollack R., Sharir M., Rote G. Computing of the geodesic center of a simple polygon. Discrete Comput. Geom. (1989) 4:611–626Crossref, Google Scholar
• Rosenstiehl P., Tarjan R. E. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. (1986) 1:343–353Crossref, Google Scholar
• Sharir M. A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom. (1997) 18:125–134Crossref, Google Scholar
• Sharir M., Welzl E. Rectilinear and polygonal p-piercing and p-center problems. Proc. 12th Annual ACM Symposium Comput. Geom. (1996) 122–132Crossref, Google Scholar
• Sherali H. D., Nordai F. L. NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands. Math. Oper. Res. (1988) 13:32–49Link, Google Scholar
• Tamir A. On the solution value of the continuous p-center location problem on a graph. Math. Oper. Res. (1987) 12:340–349Link, Google Scholar
• Weber A.Über den Standort der Industrien, 1. Teil: Reine Theorie des Standortes (1909) (Tübingen, Germany) Google Scholar
• Weinbrecht K. Kontinuierliche Standortprobleme in Polygonen. (1999) . Ph.D. thesis, Universität zu Köln, Köln, GermanyGoogle Scholar
• Wesolowsky G. The Weber problem: History and perspective. Location Sci. (1993) 1:5–23Google Scholar
• Wesolowsky G. O., Love R. F. Location of facilities with rectangular distances among point and area destinations. Naval Res. Logist. Quart. (1971a) 18:83–90Crossref, Google Scholar
• Wesolowsky G. O., Love R. F. The optimal location of new facilities using rectangular distances. Oper. Res. (1971b) 19:124–130Link, Google Scholar
• Wesolowsky G. O., Love R. F. A nonlinear approximation method for solving a generalized rectangular distance Weber problem. Management Sci. (1972) 11:656–663Link, Google Scholar
• Zemel E. Probabilistic analysis of geometric location problems. SIAM J. Algorithm Discrete Methods (1985) 6:189–200Crossref, Google Scholar