{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:18Z","timestamp":1759063818647},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,9,20]],"date-time":"2006-09-20T00:00:00Z","timestamp":1158710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,10,21]]},"DOI":"10.1007\/s10878-006-9000-1","type":"journal-article","created":{"date-parts":[[2006,10,8]],"date-time":"2006-10-08T10:38:14Z","timestamp":1160303894000},"page":"351-361","source":"Crossref","is-referenced-by-count":21,"title":["The shortest path improvement problems under Hamming distance"],"prefix":"10.1007","volume":"12","author":[{"given":"Binwu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Liqun","family":"Qi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,20]]},"reference":[{"key":"9000_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton D, Toint Ph L (1992) On an instance of the inverse shortest path problem. Math Programming 53:45\u201361","journal-title":"Math Programming"},{"key":"9000_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, CA"},{"issue":"1","key":"9000_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10878-005-5486-1","volume":"9","author":"Y He","year":"2005","unstructured":"He Y, Zhang B, Yao E (2005) Weighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9(1):91\u2013100","journal-title":"J Comb Optim"},{"key":"9000_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","volume":"12","author":"S Xu","year":"1995","unstructured":"Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J Ind Appl Math 12:47\u201359","journal-title":"Japan J Ind Appl Math"},{"key":"9000_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1022429905385","volume":"25","author":"J Zhang","year":"2003","unstructured":"Zhang J, Lin Y (2003) Computation of the reverse shortest-path problem. J. Global Optim 25:243\u2013261","journal-title":"J. Global Optim"},{"key":"9000_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J Zhang","year":"1995","unstructured":"Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR-Math Methods Oper Res 41:347\u2013358","journal-title":"ZOR-Math Methods Oper Res"},{"issue":"2","key":"9000_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10878-005-6856-4","volume":"9","author":"B Zhang","year":"2005","unstructured":"Zhang B, Zhang J, He Y (2005) The center location improvement under Hamming distance. J Comb Optim 9(2):187\u2013198","journal-title":"J Comb Optim"},{"key":"9000_CR8","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"B Zhang","year":"2006","unstructured":"Zhang B, Zhang J, He Y (2006) Constrained inverse minimum spanning tree problems under bottleneck-type Hamming distance. J Global Optim 34:467\u2013474","journal-title":"J Global Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9000-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9000-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9000-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9000-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,20]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10,21]]}},"alternative-id":["9000"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9000-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,20]]}}}