{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:28Z","timestamp":1759847548153},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10898-005-1649-y","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T11:43:24Z","timestamp":1146915804000},"page":"551-567","source":"Crossref","is-referenced-by-count":13,"title":["A Class of Inverse Dominant Problems under Weighted l\u221e Norm and an Improved Complexity Bound for Radzik\u2019s Algorithm"],"prefix":"10.1007","volume":"34","author":[{"given":"Qin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoguang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1649_CR1","doi-asserted-by":"crossref","unstructured":"Burton, D., Pulleyblank, W. R., and Toint, Ph. L. (1997), The inverse shortest paths problem with upper bounds on shortest paths costs, Network Optimization, (Gainesville, FL, 1996), Springer, Berlin, 156\u2013171.","DOI":"10.1007\/978-3-642-59179-2_8"},{"key":"1649_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","journal-title":"Mathematical Programming"},{"key":"1649_CR3","first-page":"113","volume-title":"The complexity of an inverse shortest paths problem, Comtemporary Trends in Discrete Mathematics","author":"S. P. Fekete","year":"1999"},{"key":"1649_CR4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","journal-title":"Journal of the ACM"},{"key":"1649_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C. Heuberger","year":"2004","journal-title":"Journal of Combinatorial Optimization"},{"key":"1649_CR6","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","journal-title":"Journal of the Association on Computing Machinery"},{"key":"1649_CR7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"1649_CR8","doi-asserted-by":"crossref","unstructured":"Radzik, T. (1993), Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In Pardalos P.M. (ed.) Complexity in Numerical Optimization, World Scientific Publishing Co, pp. 351\u2013386.","DOI":"10.1142\/9789814354363_0016"},{"key":"1649_CR9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1022429905385","volume":"25","author":"J.Z. Zhang","year":"2003","journal-title":"Journal of Global Optimization"},{"key":"1649_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1013807829021","volume":"6","author":"J. Zhang","year":"2002","journal-title":"In Journal of Combinatorial Optimization"},{"key":"1649_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1080\/10556780290027819","volume":"17","author":"J. Zhang","year":"2002","journal-title":"In Optimization Methods and Software"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-005-1649-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-005-1649-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-005-1649-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:03Z","timestamp":1559304723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-005-1649-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["1649"],"URL":"https:\/\/doi.org\/10.1007\/s10898-005-1649-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}