Asymmetric distances, semidirected networks and majority in Fermat-Weber problems

Annals of Operations Research

Volumn 167, Issue 1, 2009, Pages 121-155

  Plastria, Frank ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

Asymmetric distance; Directed network; Dominance; Fermat Weber problem; Node optimality; Quasimetric; Semidirected network

Indexed keywords

EID: 67349206638     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0351-0     Document Type: Article

References (51)

1. G. E. Albert 1940 A note on quasimetric spaces Bulletin of the American Mathematical Society 46 219
2. Bourbaki, N. (1943). Topologie générale. Paris: Herman.
3. Blumenthal, L. M. (1970). Theory and applications of distance geometry. Bronx: Chelseta Publ. Co.
4. D. J. Buchanan G. O. Wesolowsky 1993 Locating a noxious facility with respect to several polygonal regions using asymmetric distances Computers and Operations Research 20 151 165
5. E. Carrizosa A. M. Rodriguez-Chia 1997 Weber problems with alternative transportation systems European Journal of Operational Research 97 87 93 (Pubitemid 127369267)
6. E. Carrizosa E. Conde M. Munõz J. Puerto 1997 Simpson points in planar problems with locational constraints. The polyhedral gauge case Mathematics of Operations Research 22 297 300 (Pubitemid 127652923)
7. Cech, E. (1966). Topological spaces. London: Interscience.
8. M. Cera F. A. Ortega 2002 Locating the median hunter among n mobile prey on the plane International Journal of Industrial Engineering 9 6 15 (Pubitemid 34434066)
9. M. Cera J. A. Mesa F. A. Ortega F. Plastria 2008 Locating a central hunter on the plane Journal of Optimization Theory and Applications 136 2 155 166
10. R. Chen 1991 An improved method for the solution of the problem of location on an inclined plane RAIRO Operations Research 25 45 53
11. Deza, M. M., & Laurent, M. (1997). Geometry of cuts and metrics. Berlin: Springer.
12. E. W. Dijkstra 1959 A note on two problems in connexion with graphs Numerische Mathematik 1 269 271
13. Z. Drezner G. O. Wesolowsky 1989 The asymmetric distance location problem Transportation Science 23 3 201 207
14. R. R. Durier 1990 On Pareto optima, the Fermat-Weber problem and polyhedral gauges Mathematical Programming 47 65 79
15. R. Durier C. Michelot 1985 Geometrical properties of the Fermat-Weber problem European Journal of Operational Research 20 3 332 343
16. J. Fliege 1994 Some new coincidence conditions in minisum multifacility location problems with mixed gauges Studies in Locational Analysis 7 49 60
17. J. Fliege 1997 Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems Journal of Optimization Theory and Applications 94 2 365 380 (Pubitemid 127099737)
18. J. Fliege 1998 A note on 'On Pareto optima, the Fermat-Weber problem, and polyhedral gauges' Mathematical Programming 84 2 435 438
19. J. Fliege 2000 Solving convex location problems with gauges in polynomial time Studies in Locational Analysis 14 153 172
20. S. L. Hakimi 1964 Optimal location of switching centers and the absolute centers and medians of a graph Operations Research 12 450 459
21. Hiriart-Urruty, J. B., & Lemaréchal, C. (2001). Fundamentals of convex analysis. Berlin: Springer.
22. Y. Hinojosa J. Puerto 2003 Single facility location problems with unbounded unit balls Mathematical Methods in Operations Research 58 87 104
23. M. J. Hodgson R. T. Wong J. Honsaker 1987 The p-centroid problem on an inclined plane Operations Research 35 2 221 233 (Pubitemid 17652591)
24. H. Idrissi O. Lefebvre C. Michelot 1988 A primal dual algorithm for a constrained Fermat-Weber problem involving mixed gauges Recherche Operationnelle / Operations Research 22 313 330
25. H. Idrissi O. Lefebvre C. Michelot 1989 Duality for constrained multifacility location problems with mixed norms and applications Annals of Operations Research 18 71 92
26. Kaufman, L., & Rousseeuw, P. (1990). Finding groups in data. New York: Wiley.
27. Kelley, J. (1975). General topology. New York: Springer.
28. Labbe, M., Peeters, D., & Thisse, J.-F. (1995). Location on networks. In M. Ball et al. (Eds.), Handbooks in OR & MS : Vol. 8. Network routing (pp. 551-624). Amsterdam: North-Holland.
29. J. Levy 1967 An extended theorem for location on a network Operational Research Quarterly 18 433 442
30. A. Lindenbaum 1926 Contributions à l'étude de l'espace métrique Fundamenta Mathematica 8 209 222
31. Love, R. F., Morris, J. G., & Wesolowski, G. O. (1988). Facility location: Models and methods. New York: Norh Holland.
32. C. Michelot O. Lefebvre 1987 A primal-dual algorithm for the Fermat-Weber problem involving mixed gauges Mathematical Programming 39 319 335 (Pubitemid 18546594)
33. E. Minieka 1979 The chinese postman problem for mixed networks Management Science 25 643 648 (Pubitemid 10438493)
34. Minkowski, H. (1911). Theorie der konvexen Körper, Gesammelte Abhandlungen (Vol. 11). Berlin: Teubner.
35. Mirchandani, P. B. (1975). Analysis of stochastic networks in emergency service systems, IRP-TR-15-75, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA.
36. S. Nickel 1998 Restricted center problems under polyhedral gauges European Journal of Operational Research 104 343 357 (Pubitemid 128389082)
37. S. Nickel J. Puerto Rodriguez-Chía 2003 An approach to location models involving sets as existing facilities Mathematics of Operations Research 28 693 715
38. P. Papini J. Puerto 2005 Location problems with different norms for different points Jouranl of Optimization Theory and Applications 125 673 695 (Pubitemid 40919975)
39. F. Plastria 1984 Localization in single facility location European Journal of Operational Research 18 215 219 (Pubitemid 14664170)
40. F. Plastria 1987 Solving general continuous single facility location problems by cutting planes European Journal of Operational Research 29 329 332 (Pubitemid 17571803)
41. F. Plastria 1992 GBSSS, the generalized big square small square method for planar single facility location European Journal of Operational Research 62 163 174
42. F. Plastria 1992 On destination optimality in asymmetric distance Fermat-Weber problems Annals of Operations Research 40 355 369
43. Plastria, F. (1992c). A majority theorem for Fermat-Weber problems in quasimetric spaces with applications to semidirected networks. In J. Moreno (Ed.), Proceedings of the sixth meeting of the EURO working group on locational analysis (pp. 153-165). Tenerife, Spain: Puerto de la Cruz.
44. F. Plastria 1994 Fully geometric solutions to some planar minimax location problems Studies in Locational Analysis 7 171 183
45. H. Ribeiro 1943 Sur les espaces a métrique faible Portugalia Mathematicae 4 21 40
46. Rinow, W. (1961). Die innere Geometrie der metrischen Räume. Berlin: Springer (in German).
47. Rockafellar, T. (1970). Convex analysis. Princeton: Princeton University Press.
48. J. E. Ward R. E. Wendell 1985 Using block norms for location modeling Operations Research 33 1074 1090
49. R. E. Wendell A. P. Hurter Jr. 1973 Optimal locations on a network Transportation Science 7 18 33
50. Witzgall, C. (1964). Optimal location of a central facility, mathematical models and concepts. Report 8388, National Bureau of Standards, Washington DC, USA.
51. C. Witzgall 1965 On convex metrics Journal of Research of the National Bureau of Standards - B. Mathematics and Mathematical Physics 69B 3 175 177