{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T11:50:19Z","timestamp":1775476219962,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007251","name":"National Research University Higher School of Economics","doi-asserted-by":"publisher","award":["HSE"],"award-info":[{"award-number":["HSE"]}],"id":[{"id":"10.13039\/501100007251","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10898-022-01256-7","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T06:47:38Z","timestamp":1669790858000},"page":"251-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees"],"prefix":"10.1007","volume":"86","author":[{"given":"Qiao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinqiang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"issue":"1","key":"1256_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0515-x","volume":"102","author":"S Ahmed","year":"2005","unstructured":"Ahmed, S., Guan, Y.: The inverse optimal value problem. Math. Program. 102(1), 91\u2013110 (2005)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1256_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Math. Program. 53(1\u20133), 45\u201361 (1992)","journal-title":"Math. Program."},{"issue":"1","key":"1256_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582056","volume":"63","author":"D Burton","year":"1994","unstructured":"Burton, D., Toint, P.L.: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math. Program. 63(1), 1\u201322 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"1256_CR4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1002\/net.20344","volume":"56","author":"T Cui","year":"2010","unstructured":"Cui, T., Hochbaum, D.S.: Complexity of some inverse shortest path lengths problems. Networks 56(1), 20\u201329 (2010)","journal-title":"Networks"},{"issue":"1","key":"1256_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.cam.2007.08.005","volume":"220","author":"Y Lv","year":"2008","unstructured":"Lv, Y., Hu, T., Wan, Z.: A penalty function method for solving inverse optimal value problem. J. Comput. Appl. Math. 220(1), 175\u2013180 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"1256_CR6","first-page":"1","volume":"3","author":"G Paleologo","year":"2001","unstructured":"Paleologo, G., Takriti, S.: Bandwidth trading: a new market looking for help from the OR community. AIRO News VI 3, 1\u20134 (2001)","journal-title":"AIRO News VI"},{"issue":"4","key":"1256_CR7","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10878-021-00721-5","volume":"41","author":"H Wang","year":"2021","unstructured":"Wang, H., Guan, X.C., Zhang, Q., Zhang, B.W.: Capacitated inverse optimal value problem on minimum spanning tree under bottleneck hamming distance. J. Combin. Optim. 41(4), 861\u2013887 (2021)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"1256_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF03167381","volume":"12","author":"S Xu","year":"1995","unstructured":"Xu, S., Zhang, J.: An inverse problem of the weighted shortest path problem. Jpn. J. Ind. Appl. Math. 12(1), 47\u201360 (1995)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"4","key":"1256_CR9","first-page":"571","volume":"36","author":"BW Zhang","year":"2008","unstructured":"Zhang, B.W., Wang, Q.: Inverse shortest path problems under Hamming distance. J. Hohai Univ. (Nat. Sci.) 36(4), 571\u2013574 (2008)","journal-title":"J. Hohai Univ. (Nat. Sci.)"},{"issue":"3","key":"1256_CR10","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10898-020-00947-3","volume":"79","author":"BW Zhang","year":"2020","unstructured":"Zhang, B.W., Guan, X.C., Pardalos, P.M., Wang, H., Zhang, Q., Liu, Y., Chen, S.Y.: The lower bounded inverse optimal value problem on minimum spanning tree under unit $$l_{\\infty }$$ norm. J. Glob. Optim. 79(3), 757\u2013777 (2020)","journal-title":"J. Glob. Optim."},{"issue":"8","key":"1256_CR11","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1007\/s11590-020-01553-8","volume":"14","author":"BW Zhang","year":"2020","unstructured":"Zhang, B.W., Guan, X.C., Zhang, Q.: Inverse optimal value problem on minimum spanning tree under unit $$l_{\\infty }$$ norm. Optim. Lett. 14(8), 2301\u20132322 (2020)","journal-title":"Optim. Lett."},{"issue":"3","key":"1256_CR12","first-page":"347","volume":"41","author":"J Zhang","year":"1995","unstructured":"Zhang, J., Ma, Z., Yang, C.: A column generation method for inverse shortest path problems. Zeitschrift f\u00fcr Oper. Res. 41(3), 347\u2013347 (1995)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"4","key":"1256_CR13","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s10898-020-00958-0","volume":"79","author":"Q Zhang","year":"2021","unstructured":"Zhang, Q., Guan, X.C., Pardalos, P.M.: Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm. J. Glob. Optim. 79(4), 959\u2013987 (2021)","journal-title":"J. Glob. Optim."},{"issue":"8","key":"1256_CR14","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1007\/s11590-020-01687-9","volume":"15","author":"Q Zhang","year":"2021","unstructured":"Zhang, Q., Guan, X.C., Wang, H., Pardalos, P.M.: Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance. Optim. Lett. 15(8), 2661\u20132680 (2021)","journal-title":"Optim. Lett."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01256-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01256-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01256-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T05:31:19Z","timestamp":1701495079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01256-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1256"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01256-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"1 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}