Locating least-distant lines in the plane

European Journal of Operational Research

Volumn 106, Issue 1, 1998, Pages 152-159

  Schöbel, Anita ^a  

^a University of Koblenz Landau   (Germany)

Author keywords

Linear facility; Norm; Planar location

Indexed keywords

EID: 0000581619     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00254-3     Document Type: Article

References (24)

1. J.A. Mesa, Continuous location of dimensional structures, Working paper, presented at Workshop on Locational Analysis, 1995.
2. J.G. Morris, J.P. Norback, A simple approach to linear facility location, Transportation Sci. 14 (1) (1980) 1-8.
3. D.T. Lee, Geometric location problems and their complexity, Lecture Notes in Comput. Sci. 233 (1986) 154-167.
4. D.T. Lee, Y.F. Wu, Geometric complexity of some location problems, Algorithmica 1 (1986) 193-211.
5. N.M. Korneenko, Optimal lines in the plane. Math. Res. 51 (1989) 43-51.
6. N.M. Korneenko, H. Martini, Hyperplane approximation and related topics, In: J. Pach (Ed.), New Trends in Discrete and Computational Geometry, Ch. 6, Springer, New York, 1993, pp. 135-162.
7. N. Megiddo, A. Tamir, Finding least-distance lines, SIAM J. Algebraic Discrete Methods 4 (2) (1983) 207-211.
8. M.E. Houle, H. Imai, K. Imai, J.-M. Robert, Weighted orthogonal linear L∝-approximation and applications. Lecture Notes in Comput. Sci. 382 (1989) 183-191.
9. N.M. Korneenko, H. Martini, Approximating finite weighted point sets by hyperplanes, Lecture Notes in Comput. Sci. 447 (1990) 276-286.
10. 1 and L∝-approximation and applications, Discrete Appl. Math. 43 (1993) 217-232.
11. R.J. Boscovich, De litteraria expeditione per pontificiam ditionem, et synopsis amplioris operis, ac habentur plura ejus ex exemplaria etiam sensorum impressa, Bononiensi Scientiarum et Artum Instituto atque Academia Commentarii 4 (1757) 353-396.
12. J. Rice, The Approximation of Functions: The Linear Theory, vol. 1, Addison-Wesley, Reading, MA, 1964.
13. W.H. Press, B.P. Flannery, S.A. Teulosky, W.T. Vetterling, Numerical Recipes, Cambridge Univ. Press, Cambridge, 1986.
14. 1 approximation, Numer. Math. 51 (1987) 531-543.
15. H.W. Hamacher, S. Nickel, Multicriteria planar location problems, Eur. J. Oper. Res. 94 (1996) 66-86.
16. R.F. Love, J.G. Morris, G.O. Wesolowsky, Facilities Location. Ch. 3.3. North-Holland, Amsterdam, 1988, pp. 51-60.
17. J.G. Morris, J.P. Norback, Linear facility location -solving extensions of the basic problem, Eur. J. Oper. Res. 12 (1983) 90-94.
18. M.I. Shamos, Computational geometry, Ph.D. Thesis, Department of Computer Science, Yale University, New Haven (1978).
19. A. Schöbel, Locating least-distant lines with block norms, in: S. Nickel, H.W. Harnacher, K. Klamroth, F. Plastria (Eds.), Studies in Locational Analysis, vol. 10, 1996. pp. 139-150.
20. H. Minkowski, Gesammelte Abhandlungen, Band 2, Chelsea, New York, 1967.
21. N. Megiddo, A. Tamir, On the complexity of locating linear facilities in the plane, Oper. Res. Lett. 1 (5) (1982) 194-197.
22. D.T. Lee, Y.T. Ching, The power of geometric duality revisited. Inform. Process. Lett. 21 (1985) 117-122.
23. E. Zemel, An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Inform. Process. Lett. 18 (1984) 123-128.
24. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach. 31 (1984) 114-127.