{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T10:33:05Z","timestamp":1713349985292},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0166-218x(99)00005-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"3-20","source":"Crossref","is-referenced-by-count":11,"title":["Geometric methods to solve max-ordering location problems"],"prefix":"10.1016","volume":"93","author":[{"given":"Matthias","family":"Ehrgott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00005-0_BIB1","first-page":"103","article-title":"Lexicographic quasiconcave multiobjective programming","volume":"21","author":"Behringer","year":"1977","journal-title":"Z. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90043-N","article-title":"A note on combinatorial optimization with max-linear objective functions","volume":"42","author":"Chung","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB3","first-page":"339","article-title":"Minimax and its applications","author":"Du","year":"1995"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB4","series-title":"Multiple Criteria Optimization \u2014 Classification and Methodology","author":"Ehrgott","year":"1997"},{"issue":"1","key":"10.1016\/S0166-218X(99)00005-0_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1022600416297","article-title":"A note on the equivalence of balance points and Pareto solutions in multiple-objective programming","volume":"92","author":"Ehrgott","year":"1997","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/trsc.6.4.379","article-title":"Geometrical solutions for some minimax location problems","volume":"6","author":"Elzinga","year":"1972","journal-title":"Transp. Sci."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB7","article-title":"Facility Layout and Location: an Analytical Approach","author":"Francis","year":"1992"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB8","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1974"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB9","article-title":"Lectures on location problems","author":"Hamacher","year":"1992"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB10","first-page":"171","article-title":"Mathematische L\u00f6sungsverfahren f\u00fcr planare Standortprobleme","author":"Hamacher","year":"1995"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB11","first-page":"149","article-title":"Median location probems with several objectives","volume":"4","author":"Hamacher","year":"1983","journal-title":"Stud. Locational Anal."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB12","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0377-2217(94)90363-8","article-title":"Combinatorial algorithms for some 1-facility median problems in the plane","volume":"79","author":"Hamacher","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB13","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/1520-6750(199509)42:6<967::AID-NAV3220420608>3.0.CO;2-X","article-title":"Restricted planar location problems and applications","volume":"42","author":"Hamacher","year":"1995","journal-title":"Naval Res. Logistics"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB14","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\/S0166-218X(99)00005-0_BIB15","article-title":"Multicriteria network location problems with sum objectives","author":"Hamacher","year":"1996"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02032304","article-title":"On spanning tree problems with multiple objectives","volume":"52","author":"Hamacher","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB17","first-page":"175","article-title":"On sets of convex bodies with common points (in German)","volume":"32","author":"Helly","year":"1923","journal-title":"Jahrb. Deutsch. Math. Vereinigung"},{"issue":"4","key":"10.1016\/S0166-218X(99)00005-0_BIB18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","article-title":"Finding the upper envelope of n line segments in o (n log n) time","volume":"33","author":"Hershberger","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB19","series-title":"Robust Discrete Optimization and Its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB20","series-title":"Facilities Location: Models and Methods","author":"Love","year":"1988"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB21","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in r3 and related problems","volume":"12","author":"Megiddo","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB22","series-title":"Discretization of Planar Location Problems","author":"Nickel","year":"1995"},{"key":"10.1016\/S0166-218X(99)00005-0_BIB23","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/S0377-2217(96)00154-3","article-title":"On the lexicographic minimax approach to location problems","volume":"100","author":"Ogryczak","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00005-0_BIB24","series-title":"Facility Location. A Survey of Applications and Methods","first-page":"225","article-title":"Continuous location problems","author":"Plastria","year":"1995"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000050?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000050?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:27:52Z","timestamp":1556652472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0166218X99000050"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00005-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}