{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:47:10Z","timestamp":1753440430322,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,1,29]],"date-time":"2018-01-29T00:00:00Z","timestamp":1517184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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\/501100005236","name":"Chinese Universities Scientific Fund","doi-asserted-by":"publisher","award":["2015B27914"],"award-info":[{"award-number":["2015B27914"]}],"id":[{"id":"10.13039\/501100005236","id-type":"DOI","asserted-by":"publisher"}]},{"name":"RSF grant","award":["14-41-00039"],"award-info":[{"award-number":["14-41-00039"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10957-018-1221-9","type":"journal-article","created":{"date-parts":[[2018,1,29]],"date-time":"2018-01-29T15:19:25Z","timestamp":1517239165000},"page":"538-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance"],"prefix":"10.1007","volume":"178","author":[{"given":"Binwu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Chunyuan","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,29]]},"reference":[{"key":"1221_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger, C.: Inverse optimization: a survey on problems, methods, and results. J. Comb. Optim. 8, 329\u2013361 (2004)","journal-title":"J. Comb. Optim."},{"key":"1221_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton, D., Toint, P.: On an instance of the inverse shortest path problem. Math. Program. 53, 45\u201361 (1992)","journal-title":"Math. Program."},{"key":"1221_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J Zhang","year":"1995","unstructured":"Zhang, J., Ma, Z., Yang, C.: A column generation method for inverse shortest path problems. ZOR Math. Method Oper. Res. 41, 347\u2013358 (1995)","journal-title":"ZOR Math. Method Oper. Res."},{"key":"1221_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1022429905385","volume":"25","author":"J Zhang","year":"2003","unstructured":"Zhang, J., Lin, Y.: Computation of the reverse shortest-path problem. J. Global Optim. 25, 243\u2013261 (2003)","journal-title":"J. Global Optim."},{"issue":"1","key":"1221_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10878-005-5486-1","volume":"9","author":"Y He","year":"2005","unstructured":"He, Y., Zhang, B., Yao, E.: Weighted inverse minimum spanning tree problems under Hamming distance. J. Comb. Optim. 9(1), 91\u2013100 (2005)","journal-title":"J. Comb. Optim."},{"key":"1221_CR6","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.ejor.2004.07.059","volume":"170","author":"DC Volgenant","year":"2006","unstructured":"Volgenant, D.C.: A some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170, 887\u2013899 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1221_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"XC Guan","year":"2012","unstructured":"Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted Hamming distance. J. Global Optim. 54(1), 75\u201382 (2012)","journal-title":"J. Global Optim."},{"issue":"4","key":"1221_CR8","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10898-017-0546-5","volume":"69","author":"XC Guan","year":"2017","unstructured":"Guan, X.C., He, X.Y., Pardalos, P.M., Zhang, B.W.: Inverse max+sum spanning tree problem under hamming distance by modifying the sum-cost vector. J. Global Optim. 69(4), 911\u2013925 (2017)","journal-title":"J. Global Optim."},{"key":"1221_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ejor.2010.03.029","volume":"207","author":"Y Jiang","year":"2010","unstructured":"Jiang, Y., Liu, L., Wu, B., Yao, E.: Inverse minimum cost flow problems under the weighted Hamming distance. Eur. J. Oper. Res. 207, 50\u201354 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1221_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2007.12.006","volume":"396","author":"L Liu","year":"2008","unstructured":"Liu, L., Yao, E.: Inverse min\u2013max spanning tree problem under the weighted sum-type Hamming distance. Theor. Comput. Sci. 396, 28\u201334 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1221_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10878-005-6856-4","volume":"9","author":"B Zhang","year":"2005","unstructured":"Zhang, B., Zhang, J., He, Y.: The center location improvement under Hamming distance. J. Comb. Optim. 9(2), 187\u2013198 (2005)","journal-title":"J. Comb. Optim."},{"key":"1221_CR12","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"B Zhang","year":"2006","unstructured":"Zhang, B., Zhang, J., He, Y.: Constrained inverse minimum spanning tree problems under bottleneck-type Hamming distance. J. Global Optim. 34, 467\u2013474 (2006)","journal-title":"J. Global Optim."},{"issue":"4","key":"1221_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10878-006-9000-1","volume":"12","author":"B Zhang","year":"2006","unstructured":"Zhang, B., Zhang, J., Qi, L.: The shortest path improvement problem under Hamming distance. J. Comb. Optim. 12(4), 351\u2013361 (2006)","journal-title":"J. Comb. Optim."},{"key":"1221_CR14","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/847317","author":"B Zhang","year":"2013","unstructured":"Zhang, B., Guan, X., He, C., Wang, S.: Algorithms for the shortest path improvement problems under unit Hamming distance. J. Appl. Math. (2013). \n                    https:\/\/doi.org\/10.1155\/2013\/847317","journal-title":"J. Appl. Math."},{"issue":"4","key":"1221_CR15","first-page":"605","volume":"11","author":"B Zhang","year":"2015","unstructured":"Zhang, B., Guan, X., Wang, Q., He, C., Samson, H.: The complexity analysis of the shortest path improvement problem under the Hamming distance. Pac. J. Optim. 11(4), 605\u2013608 (2015)","journal-title":"Pac. J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1221-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1221-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1221-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T21:10:13Z","timestamp":1548709813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1221-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,29]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1221"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1221-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2018,1,29]]},"assertion":[{"value":"4 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}