On the continuous Fermat-Weber problem

Operations Research

Volumn 53, Issue 1, 2005, Pages 61-76

  Fekete, Sándor P ^a   Mitchell, Joseph S B ^b   Beurer, Karin ^c  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b Stony Brook University   (United States)

^c SAP RESEARCH   (Germany)

Author keywords

Continuous demand; Continuous location: Fermat Weber problem; Facilities equipment planning

Indexed keywords

CONTINUOUS DEMAND; CONTINUOUS LOCATION; FACILITIES/EQUIPMENT PLANNING; FERMAT-WEBER PROBLEM;

ALGEBRA; ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION;

PROBLEM SOLVING;

EID: 14644410380     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0137     Document Type: Article

References (65)

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