{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:32:03Z","timestamp":1771003923850,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00384-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"505-522","source":"Crossref","is-referenced-by-count":38,"title":["Complexity of robust single facility location problems on networks with uncertain edge lengths"],"prefix":"10.1016","volume":"127","author":[{"given":"Igor","family":"Averbakh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0166-218X(02)00384-0_BIB1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0167-6377(00)00025-0","article-title":"Minmax regret solutions for minimax optimization problems with uncertainty","volume":"27","author":"Averbakh","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB2","unstructured":"I. Averbakh, O. Berman, Algorithms for robust center problems. Presented at INFORMS Conference, Dallas, October, 1997."},{"issue":"2","key":"10.1016\/S0166-218X(02)00384-0_BIB3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","article-title":"Minmax regret robust median location on a network under uncertainty","volume":"12","author":"Averbakh","year":"2000","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","article-title":"Algorithms for the robust 1-center problem","volume":"123","author":"Averbakh","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E","article-title":"Robust one-median location problem","volume":"31","author":"Chen","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00384-0_BIB6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1287\/opre.14.3.409","article-title":"Optimum locations on a graph with probabilistic demands","volume":"14","author":"Frank","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB7","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1287\/opre.15.3.552","article-title":"Optimum locations on a graph with correlated normal demands","volume":"14","author":"Frank","year":"1967","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB8","series-title":"Computers and Intractability","author":"Gary","year":"1979"},{"key":"10.1016\/S0166-218X(02)00384-0_BIB9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","article-title":"Optimal center location in simple networks","volume":"5","author":"Goldman","year":"1971","journal-title":"Transportation Sci."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB10","unstructured":"P. Kouvelis, G. Vairaktarakis, G. Yu, Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty, Working Paper 93\/94-3-4, Department of Management Science and Information Systems, Graduate School of Business, The University of Texas, Austin."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB11","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(02)00384-0_BIB12","doi-asserted-by":"crossref","unstructured":"M. Labbe, D. Peeters, J.-F. Thisse, Location on networks, in: Handbooks in Operations Research and Management Science, Vol. 8, Elsevier, Amsterdam, 1995, pp. 551\u2013624.","DOI":"10.1016\/S0927-0507(05)80111-2"},{"key":"10.1016\/S0166-218X(02)00384-0_BIB13","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/opre.39.6.961","article-title":"Sensitivity analysis in minisum facility location problems","volume":"39","author":"Labbe","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB14","unstructured":"P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley, New York, 1990."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/trsc.13.2.85","article-title":"Location of medians on stochastic networks","volume":"13","author":"Mirchandani","year":"1979","journal-title":"Transportation Sci."},{"issue":"2","key":"10.1016\/S0166-218X(02)00384-0_BIB16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","article-title":"Robust optimization of large scale systems","volume":"43","author":"Mulvey","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00384-0_BIB17","unstructured":"B. Tansel, G. Scheuenstuhl, Facility location on tree networks with imprecise data, Research Report IEOR-8819, Bilkent University, 1988."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003840?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003840?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T03:27:36Z","timestamp":1583983656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003840"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00384-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}