{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T09:26:22Z","timestamp":1785403582143,"version":"3.56.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1023\/a:1008360312607","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"213-218","source":"Crossref","is-referenced-by-count":112,"title":["The Complexity Analysis of the Inverse Center Location Problem"],"prefix":"10.1007","volume":"15","author":[{"given":"M.C.","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"X.G.","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.Z.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"211109_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"Burton, D. and Toint, Ph.L., (1992). On an instance of the inverse shortest paths problem, Mathematical Programming, 53: 45\u201361.","journal-title":"Mathematical Programming"},{"key":"211109_CR2","doi-asserted-by":"crossref","unstructured":"Burton, D., Pulleyblank, B. and Toint, Ph.L. (1997). The inverse shortest path problem with upper bounds on shortest path costs, in Network Optimization, edited by P.M. Pardalos, D.H. Hearn and W.H. Hager, Lecture Notes in Economics and Mathematical Systems 450: 156\u2013171.","DOI":"10.1007\/978-3-642-59179-2_8"},{"key":"211109_CR3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J.Z. Zhang","year":"1996","unstructured":"Zhang, J.Z. and Liu, Z.H. (1996). Calculating some inverse linear programming problems, J. Computational and Applied Mathematics 72: 261\u2013273.","journal-title":"J. Computational and Applied Mathematics"},{"key":"211109_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"J.Z. Zhang","year":"1996","unstructured":"Zhang, J.Z. and Ma, Z.F. (1996). A network flow method for solving some inverse combinatorial optimization problems, Optimization 37: 59\u201372.","journal-title":"Optimization"},{"key":"211109_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01193863","volume":"45","author":"M.C. Cai","year":"1997","unstructured":"Cai, M.C. and Li, Y.J. (1997). Inverse matroid intersection problem, ZOR Math. Meth. Oper. Res. 45: 235\u2013243.","journal-title":"ZOR Math. Meth. Oper. Res."},{"issue":"2","key":"211109_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0893-9659(98)00151-7","volume":"12","author":"C. Yang","year":"1999","unstructured":"Yang, C. and Zhang, J. Z. (1999). Two general methods for inverse optimization problems, Appl. Math. Lett. 12(2): 69\u201372.","journal-title":"Appl. Math. Lett."},{"key":"211109_CR7","volume-title":"Graph Theory: An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"Christofides, N. (1975). Graph Theory: An Algorithmic Approach, Academic Press, London."},{"key":"211109_CR8","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H. and Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey."},{"key":"211109_CR9","doi-asserted-by":"crossref","unstructured":"Cook, S.A. (1971). The complexity of theorem proving procedures, Proceedings of the 3rd ACM Symposium on the Theory of Computing, 151\u2013158.","DOI":"10.1145\/800157.805047"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008360312607.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008360312607\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008360312607.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:45:19Z","timestamp":1751366719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008360312607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["211109"],"URL":"https:\/\/doi.org\/10.1023\/a:1008360312607","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}