{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T16:58:39Z","timestamp":1700672319637},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":[[2004,5]]},"DOI":"10.1016\/s0377-2217(02)00876-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T18:20:01Z","timestamp":1047666001000},"page":"251-257","source":"Crossref","is-referenced-by-count":9,"title":["Inapproximability and a polynomially solvable special case of a network improvement problem"],"prefix":"10.1016","volume":"155","author":[{"given":"J.Z.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X.G.","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.C.","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00876-7_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(02)00876-7_BIB2","series-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0377-2217(02)00876-7_BIB3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1006\/jagm.1993.1048","article-title":"Finding the minimum-cost maximum flow in a serial\u2013parallel network","volume":"15","author":"Booth","year":"1993","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(02)00876-7_BIB4","doi-asserted-by":"crossref","unstructured":"D. Burton, W.R. Pulleyblank, Ph.L. Toint, The inverse shortest paths with upper bounds on shortest path costs, Network Optimization (Gainesville, FL, 1996), 156\u2013171, Lecture Notes in Economical and Mathematical Systems, Springer, Berlin, 1997, 450","DOI":"10.1007\/978-3-642-59179-2_8"},{"key":"10.1016\/S0377-2217(02)00876-7_BIB5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear program","volume":"34","author":"Tardos","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00876-7_BIB6","doi-asserted-by":"crossref","unstructured":"J. Zhang, X. Yang, M. Cai, Reverse Center Location Problem Algorithms and Computation (Chennia, 1999), 279\u2013294, Lecture Notes in Computer Science, Springer, Berlin, 1999, 1741","DOI":"10.1007\/3-540-46632-0_29"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T11:54:23Z","timestamp":1553601263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0377221702008767"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00876-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}