{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:13:33Z","timestamp":1649099613335},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":4125,"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":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00257-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"73-83","source":"Crossref","is-referenced-by-count":1,"title":["On the approximation of the Minimum Disturbance p-Facility Location Problem"],"prefix":"10.1016","volume":"118","author":[{"given":"Giulia","family":"Galbiati","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00257-8_BIB1","unstructured":"E. Amaldi, Private communication."},{"key":"10.1016\/S0166-218X(01)00257-8_BIB2","unstructured":"P. Cappanera, Discrete facility location and routing of obnoxious activities, Ph.D. Thesis, Dipartimento di Matematica, Universit\u00e0 Statale di Milano, 1999."},{"key":"10.1016\/S0166-218X(01)00257-8_BIB3","unstructured":"P. Crescenzi, V. Kann, A compendium of NP optimization problems, Technical Report SI\/RR-95\/02, Dipartimento di Scienze dell\u2019 Informazione, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, this list of problems is continuously updated and available at http:\/\/www.nada.kth.se\/theory\/problemlist.html."},{"key":"10.1016\/S0166-218X(01)00257-8_BIB4","series-title":"Annotated Bibliographies in Combinatorial Optimization","author":"Dell'Amico","year":"1997"},{"key":"10.1016\/S0166-218X(01)00257-8_BIB5","series-title":"Facility Location, A Survey of Applications and Methods","author":"Drezner (Ed.)","year":"1995"},{"key":"10.1016\/S0166-218X(01)00257-8_BIB6","series-title":"Handbooks in Operations Research and Management Sciences 8: Network Routing","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/S0927-0507(05)80111-2","article-title":"Location on networks","author":"Labb\u00e9","year":"1995"},{"key":"10.1016\/S0166-218X(01)00257-8_BIB7","series-title":"Lectures on Proof Verification and Approximation Algorithms","author":"Mayr","year":"1998"},{"key":"10.1016\/S0166-218X(01)00257-8_BIB8","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0166-218X(01)00257-8_BIB9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: approximating packing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"J. Comput. System Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:57:16Z","timestamp":1556762236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002578"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00257-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}