{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:07Z","timestamp":1725583987486},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_23","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"221-230","source":"Crossref","is-referenced-by-count":3,"title":["Inverse Maximum Flow Problems under the Combining Norms"],"prefix":"10.1007","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New York (1993)"},{"key":"23_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 paths problem. Mathematical Programming\u00a053, 45\u201361 (1992)","journal-title":"Mathematical Programming"},{"key":"23_CR3","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.: Wighted inverse minimum spanning tree problems under Hamming distance. Journal of Combinatorial Optimization\u00a09, 91\u2013100 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"23_CR4","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. Journal of Combinatorial Optimization\u00a08, 329\u2013361 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1080\/10020070612331343207","volume":"16","author":"L. Liu","year":"2006","unstructured":"Liu, L., He, Y.: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values. Progress in Natural Science\u00a016, 649\u2013655 (2006)","journal-title":"Progress in Natural Science"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1142\/S0217595907001474","volume":"24","author":"L. Liu","year":"2007","unstructured":"Liu, L., Yao, E.: A weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia-Pacific Journal of Operational Research\u00a024, 725\u2013736 (2007)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10878-006-9006-8","volume":"12","author":"L. Liu","year":"2006","unstructured":"Liu, L., Zhang, J.: Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization\u00a012, 395\u2013408 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"key":"23_CR8","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"C. Yang","year":"1997","unstructured":"Yang, C., Zhang, J., Ma, Z.: Inverse maximum flow and minimum cut problems. Optimization\u00a040, 147\u2013170 (1997)","journal-title":"Optimization"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J. Zhang","year":"1997","unstructured":"Zhang, J., Xu, S., Ma, Z.: An algorithm for inverse minimum spanning tree problem. Optimization Methods and Software\u00a08, 69\u201384 (1997)","journal-title":"Optimization Methods and Software"},{"key":"23_CR11","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 problems under Hamming distance. Journal of Combinatorial Optimization\u00a012, 351\u2013361 (2006)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:07:55Z","timestamp":1557702475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}