{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:02:22Z","timestamp":1777608142027,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00254-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"152-159","source":"Crossref","is-referenced-by-count":20,"title":["Locating least-distant lines in the plane"],"prefix":"10.1016","volume":"106","author":[{"given":"Anita","family":"Sch\u00f6bel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00254-3_BIB1","series-title":"Working paper, presented at Workshop on Locational Analysis","article-title":"Continuous location of dimensional structures","author":"Mesa","year":"1995"},{"issue":"1","key":"10.1016\/S0377-2217(97)00254-3_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.14.1.1","article-title":"A simple approach to linear facility location","volume":"14","author":"Morris","year":"1980","journal-title":"Transportation Sci."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BFb0016240","article-title":"Geometric location problems and their complexity","volume":"233","author":"Lee","year":"1986","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01840442","article-title":"Geometric complexity of some location problems","volume":"1","author":"Lee","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB5","first-page":"43","article-title":"Optimal lines in the plane","volume":"51","author":"Korneenko","year":"1989","journal-title":"Math. Res."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB6","series-title":"New Trends in Discrete and Computational Geometry","first-page":"135","article-title":"Hyperplane approximation and related topics","author":"Korneenko","year":"1993"},{"issue":"2","key":"10.1016\/S0377-2217(97)00254-3_BIB7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0604021","article-title":"Finding least-distance lines","volume":"4","author":"Megiddo","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-51542-9_16","article-title":"Weighted orthogonal linear L\u221e-approximation and applications","volume":"382","author":"Houle","year":"1989","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB9","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-52846-6_96","article-title":"Approximating finite weighted point sets by hyperplanes","volume":"447","author":"Korneenko","year":"1990","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(93)90113-3","article-title":"Orthogonal weighted linear L1 and L\u221e-approximation and applications","volume":"43","author":"Houle","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB11","first-page":"353","article-title":"De litteraria expeditione per pontificiam ditionem, et synopsis amplioris operis, ac habentur plura ejus ex exemplaria etiam sensorum impressa","volume":"4","author":"Boscovich","year":"1757","journal-title":"Bononiensi Scientiarum et Artum Instituto atque Academia Commentarii"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB12","volume":"vol. 1","author":"Rice","year":"1964"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB13","series-title":"Numerical Recipes","author":"Press","year":"1986"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB14","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/BF01400354","article-title":"On orthogonal linear L1 approximation","volume":"51","author":"Sp\u00e4th","year":"1987","journal-title":"Numer. Math."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0377-2217(95)00186-7","article-title":"Multicriteria planar location problems","volume":"94","author":"Hamacher","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB16","first-page":"51","article-title":"Facilities Location","author":"Love","year":"1988"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0377-2217(83)90183-2","article-title":"Linear facility location \u2014 solving extensions of the basic problem","volume":"12","author":"Morris","year":"1983","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB18","article-title":"Computational geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB19","first-page":"139","article-title":"Locating least-distant lines with block norms","volume":"vol. 10","author":"Sch\u00f6bel","year":"1996"},{"key":"10.1016\/S0377-2217(97)00254-3_BIB20","volume":"Band 2","author":"Minkowski","year":"1967"},{"issue":"5","key":"10.1016\/S0377-2217(97)00254-3_BIB21","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","article-title":"On the complexity of locating linear facilities in the plane","volume":"1","author":"Megiddo","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","article-title":"The power of geometric duality revisited","volume":"21","author":"Lee","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","article-title":"An O(n) algorithm for the linear multiple choice knapsack problem and related problems","volume":"18","author":"Zemel","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0377-2217(97)00254-3_BIB24","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002543?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002543?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:55:45Z","timestamp":1556110545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002543"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00254-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}