Locating a central hunter on the plane

Journal of Optimization Theory and Applications

Volumn 136, Issue 2, 2008, Pages 155-166

  Cera, M ^a   Mesa, J A ^b   Ortega, F A ^a   Plastria, F ^c  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSIDAD DE SEVILLA   (Spain)

^c VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

Center problem; Continuous location; Elliptic gauge; Game theory; Hunter distance; Skewed norm; Travel time

Indexed keywords

GAME THEORY; LOCATION;

ASYMMETRIC DISTANCES; CENTER PROBLEMS; CONTINUOUS LOCATIONS; DISTANCE MEASURE; ELLIPTIC GAUGE; EUCLIDEAN; FIXED POINTS; HUNTER DISTANCE; SKEWED NORM; TRAVEL-TIME;

TRAVEL TIME;

EID: 38549182502     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-007-9293-y     Document Type: Article

References (15)

1. Plastria, F.: Continuous covering location problems. In: Hamacher, H., Drezner, Z. (eds.) Location Analysis: Theory and Applications, pp. 39-83. Springer, Berlin (2001)
2. Barton, J.C., Eliezer, C.J.: Pursuit curves II. Bull. Inst. Math. Appl. 31, 139-141 (1995)
3. Barton, J.C., Eliezer, C.J.: On pursuit curves. J. Aust. Math. Soc. 41, 358-371 (2000)
4. Cera, M., Ortega, F.A.: Locating the median hunter among n mobile preys on the plane. Int. J. Ind. Eng.: Theory Appl. Pract. 9, 6-15 (2002)
5. Plastria, F.: On destination optimality in asymmetric distance Fermat-Weber problems. Ann. Oper. Res. 40, 355-369 (1992)
6. Pelegrín, B., Michelot, C., Plastria, F.: On the uniqueness of optimal solutions in continuous location theory. Eur. J. Operat. Res. 20, 327-331 (1985)
7. Drezner, Z.: On minmax optimization problems. Math. Program. 22, 227-230 (1982)
8. Elzinga, D.J., Hearn, D.W.: Geometrical solutions for some minimax location problems. Transp. Sci. 6, 379-394 (1972)
9. Charalambous, C.: Extension of the Elzinga-Hearn algorithm to the weighted case. Operat. Res. 30, 591-594 (1982)
10. Hearn, D.W., Vijay, J.: Efficient algorithms for the (weighted) minimum circle problem. Operat. Res. 30, 777-795 (1982)
11. Welzl, E.: Smallest enclosing disk (balls and ellipsoids), new results and new trends in computer science. In: Maurer, H. (ed.) Lecture Notes in Computer Science, vol. 555, pp. 359-370. Springer, New York (1991)
12. Plastria, F.: Fully geometric solutions to some planar center minimax location problems. Stud. Locat. Analysis 7, 171-183 (1994)
13. Chrystal, G.: On the problem to construct the minimum circle enclosing n given points in the plane. Proc. Edinb. Math. Soc. 3, 30-33 (1885)
14. Shamos, M.I., Hoey, D.: Closest point problems. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pp. 151-162 (1975)
15. Megiddo, N.: The weighted Euclidean 1-center problem. Math. Operat. Res. 8, 498-504 (1983)