Geoscience Reference
In-Depth Information
Megiddo N, Tamir A (1982) On the complexity of locating linear facilities in the plane. Oper Res
Lett 1:194-197
Megiddo N, Tamir A (1983) Finding least-distance lines. SIAM J Algebr Discrete Method 4:207-
211
Morris J, Norback J (1980) A simple approach to linear facility location. Transp Sci 14:1-8
Morris J, Norback J (1983) Linear facility location - solving extensions of the basic problem. Eur
J Oper Res 12:90-94
Moura L, Kitney R (1992) A direct method for least-squares circle fitting. Comput Phys Commun
64:57-63
Mukherjee J, Sinha Mahapatra PR, Karmakar A, Das S (2013) Minimum-width rectangular
annulus. Theor Comput Sci 508:74-80
Narula SC, Wellington JF (1982) The minimum sum of absolute errors regression: a state of the
art survey. Int Stat Rev 50:317-326
Nickel S, Puerto J (2005) Location theory: a unified approach. Springer, Berlin/Heidelberg
Nievergelt Y (2002) A finite algorithm to fit geometrically all midrange lines, circles, planes,
spheres, hyperplanes, and hyperspheres. Numer Math 91:257-303
Nievergelt Y (2004) Perturbation analysis for circles, spheres, and generalized hyperspheres fitted
to data by geometric total least-squares. Math Comput 73:169-180
Nievergelt Y (2010) Median spheres: theory, algorithms, applications. Numer Math 114:573-606
Overmars MH, van Leeuwen J (1981) Maintenance of configurations in the plane. J Comput Syst
Sci 23:166-204
Plastria F (1992) GBSSS: the generalized big square small square method for planar single-facility
location. Eur J Oper Res 62:163-174
Plastria F (2001) Continuous covering location problems. In: Drezner Z, Hamacher H (eds) Facility
location - applications and theory. Springer, Berlin/Heidelberg, pp 1-36
Plastria F, Carrizosa
E (2001)
Gauge-distances
and median hyperplanes.
J Optim Theory
Appl 110:173-182
Plastria F, Carrizosa E (2012) Minmax-distance approximation and separation problems: geomet-
rical properties. Math Program 132:153-177
Rivlin T (1979) Approximation by circles. Computing 21:1-17
Robert JM (1991) Linear approximation and line transversals. Ph.D. thesis, School of Computer
Sciences, McGill University, Montreal
Robert JM, Toussaint G (1994) Linear approximation of simple objects. Comput Geom Theor Appl
4:27-52
Robins G, Shute C (1987) The Rhind mathematical papyrus. An ancient Egyptian text. British
Museum
Rockafellar R (1970) Convex analysis. Princeton Landmarks, Princeton
Rorres C, Romano D (1997) Finding the center of a circular starting line in an Ancient Greek
stadium. SIAM Rev 39:745-754
Sarkar A, Batta R, Nagi R (2007) Placing a finite size facility with a center objective on a
rectangular plane with barriers. Eur J Oper Res 179:1160-1176
Savas S, Batta R, Nagi R (2002) Finite-size facility placement in the presence of barriers to
rectilinear travel. Oper Res 50:1018-1031
Schieweck R (2013) Lower bounds for line location problems via demand regions. Technical
report 28. Institut für Numerische und Angewandte Mathematik, Universität of Göttingen,
Göttingen
Schieweck R, Schöbel A (2012) Properties and algorithms for line location with extensions. In:
Proceedings of the 28th European workshop on computational geometry, Assisi, Italy, pp 185-
188
Schöbel A (1996) Locating least-distant lines with block norms. Stud Locat Anal 10:139-150
Schöbel A (1997) Locating line segments with vertical distances. Stud Locat Anal 11:143-158
Schöbel A (1998) Locating least distant lines in the plane. Eur J Oper Res 106:152-159
Schöbel A (1999a) Locating lines and hyperplanes—theory and algorithms. Applied optimization
series, vol 25. Kluwer, Dordrecht
