{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T02:47:16Z","timestamp":1775702836626,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,11,1]],"date-time":"1979-11-01T00:00:00Z","timestamp":310262400000},"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":12312,"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":[[1979,11]]},"DOI":"10.1016\/0166-218x(79)90044-1","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"209-215","source":"Crossref","is-referenced-by-count":145,"title":["Easy and hard bottleneck location problems"],"prefix":"10.1016","volume":"1","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(79)90044-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(79)90044-1_BIB2","series-title":"Graph Theory: An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/0166-218X(79)90044-1_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.12.2.107","article-title":"Locating an obnoxious facility on a network","volume":"12","author":"Church","year":"1978","journal-title":"Transportation Sci."},{"key":"10.1016\/0166-218X(79)90044-1_BIB4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","article-title":"Bottleneck extrema","volume":"8","author":"Edmonds","year":"1970","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0166-218X(79)90044-1_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(79)90044-1_BIB6","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1287\/opre.9.6.898","article-title":"The maximum capacity route problem","volume":"9","author":"Hu","year":"1961","journal-title":"Operations Res."},{"key":"10.1016\/0166-218X(79)90044-1_BIB7","series-title":"Introduction to Dynamic Programming","author":"Nemhauser","year":"1966"},{"key":"10.1016\/0166-218X(79)90044-1_BIB8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(79)90044-1_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/trsc.11.3.243","article-title":"A min-max theooem for p-center problems on a tree","volume":"11","author":"Shier","year":"1977","journal-title":"Transportation Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900441?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900441?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:26:53Z","timestamp":1554906413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X79900441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,11]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,11]]}},"alternative-id":["0166218X79900441"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(79)90044-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1979,11]]}}}