{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T06:46:12Z","timestamp":1773125172433,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262244","type":"print"},{"value":"9783540324409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_45","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"422-426","source":"Crossref","is-referenced-by-count":3,"title":["Inverse Problems of Some NP-Complete Problems"],"prefix":"10.1007","author":[{"given":"Siming","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"45_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.10048","volume":"40","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Orlin, J.B.: Combinatorial algorithms for inverse network flow problems. Networks\u00a040(4), 181\u2013187 (2002)","journal-title":"Networks"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"R.K. Ahuja","year":"2000","unstructured":"Ahuja, R.K., Orlin, J.B.: A fast algorithm for the inverse spanning tree problem. J. of Algorithms\u00a034, 177\u2013193 (2000)","journal-title":"J. of Algorithms"},{"key":"45_CR3","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. Mathematical Programming\u00a053, 45\u201361 (1992)","journal-title":"Mathematical Programming"},{"key":"45_CR4","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. Mathematical Programming\u00a063, 1\u201322 (1994)","journal-title":"Mathematical Programming"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Burton, D., Pulleyblank, B., Toint, P.L.: The inverse shortest paths problem with upper bounds on shortest paths costs. In: Pardalos, P., Hearn, D.W., Hager, W.H. (eds.) Network Optimization. Lecture notes in Economics and Mathematical Systems, vol.\u00a0450, pp. 156\u2013171 (1997)","DOI":"10.1007\/978-3-642-59179-2_8"},{"key":"45_CR6","unstructured":"Dial, B.: Minimum-revenue congestion pricing, Part 1: A fast algorithm for the single-origin case. Technical Report, The Volpe National Transportation Systems Center, Kendall Square, Cambridge, MA 02142"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0377-2217(97)00444-X","volume":"112","author":"S. Huang","year":"1999","unstructured":"Huang, S., Liu, Z.: On the inverse problem of linear programming and its application to minimum weight perfect k-matching. European Journal of Operational Research\u00a0112, 421\u2013426 (1999)","journal-title":"European Journal of Operational Research"},{"key":"45_CR8","unstructured":"Huang, S., Liu, Z.: On the inverse minimum cost flow problem. In: Advances in Operations Research and Systems Engineering, pp. 30\u201337. World Publishing, Co. (1998)"},{"key":"45_CR9","unstructured":"Heuberger, C.: Inverse combinatorial optimization: A survey on problems, methods, and results. J. of Combinatorial Optimization"},{"key":"45_CR10","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1287\/opre.47.2.291","volume":"47","author":"P.T. Sokkalingam","year":"1999","unstructured":"Sokkalingam, P.T., Ahuja, R.K., Orlin, J.B.: Solving inverse spanning tree problems through network flow techniques. Operations Research\u00a047, 291\u2013298 (1999)","journal-title":"Operations Research"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"J. Zhang","year":"1996","unstructured":"Zhang, J., Liu, Z., Ma, Z.: On the inverse problem of minimum spanning tree with partition constraints. Mathematical Methods of Operations Research\u00a044, 171\u2013188 (1996)","journal-title":"Mathematical Methods of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:00Z","timestamp":1619505600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11496199_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}