{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:51Z","timestamp":1759063491841,"version":"3.41.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1023\/a:1009883605691","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"465-474","source":"Crossref","is-referenced-by-count":6,"title":["Inverse Problems of Matroid Intersection"],"prefix":"10.1007","volume":"3","author":[{"given":"Cai","family":"Mao-Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"244020_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall: NJ, 1993."},{"key":"244020_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"D. Burton and Ph.L. Toint, \"On an instance of the inverse shortest paths problem,\" Mathematical Programming, vol. 53, pp. 45-61, 1992.","journal-title":"Mathematical Programming"},{"key":"244020_CR3","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"A. Frank, \"An algorithm for submodular functions on graphs,\" Annals of Discrete Mathematics, vol. 16, pp. 97-120, 1982.","journal-title":"Annals of Discrete Mathematics"},{"key":"244020_CR4","volume-title":"Technical Report STAN-CS-89-1252","author":"A.V. Goldberg","year":"1989","unstructured":"A.V. Goldberg, \u00b4E. Tardos, and R.E. Tarjan, \"Network flow algorithms,\" Technical Report STAN-CS-89-1252, Department of Computer Science, Stanford University, Stanford, CA, March 1989."},{"key":"244020_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithm and Combinatorial Optimization","author":"M. Gr\u00a8otschel","year":"1993","unstructured":"M. Gr\u00a8otschel, L. Lovasz, and A. Schrijver, Geometric Algorithm and Combinatorial Optimization, Springer: Berlin, 1993."},{"key":"244020_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)86750-9","volume":"82","author":"Z. Hu","year":"1998","unstructured":"Z. Hu and Z. Liu, \"A strongly polynomial algorithm for the inverse shortest arborescence problem,\" Discrete Appl. Math., vol. 82, pp. 135-154, 1998.","journal-title":"Discrete Appl. Math."},{"key":"244020_CR7","unstructured":"S. Huang and Z. Liu, \"On the inverse problem of k-matching of bipartite graph,\" to appear in European J. Operations Research."},{"key":"244020_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Rinehart Winston: New York, 1976."},{"key":"244020_CR9","doi-asserted-by":"crossref","unstructured":"J.B. Orlin, \"A Faster Strongly Polynomial Minimum Cost Flow Algorithm,\" in Proc. 20th ACM Symp. on the Theory of Comp, 1988, pp. 377-387.","DOI":"10.1145\/62212.62249"},{"key":"244020_CR10","volume-title":"Matroid Theory and its Applications","author":"A. Recski","year":"1989","unstructured":"A. Recski, Matroid Theory and its Applications, Springer: Berlin, 1989."},{"key":"244020_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00b4E. Tardos","year":"1985","unstructured":"\u00b4E. Tardos, \"A strongly polynomial minimum cost circulation algorithm,\" Combinatorica, vol. 5, pp. 247-255, 1985.","journal-title":"Combinatorica"},{"key":"244020_CR12","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00b4E. Tardos","year":"1986","unstructured":"\u00b4E. Tardos, \"A strongly polynomial algorithm to solve combinatorial linear programs,\" Operations Research, vol. 34, pp. 250-256, 1986.","journal-title":"Operations Research"},{"key":"244020_CR13","volume-title":"Matroid Theory","author":"D. Welsh","year":"1976","unstructured":"D. Welsh, Matroid Theory, Academic Press: London, 1976."},{"key":"244020_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"J. Zhang","year":"1996","unstructured":"J. Zhang and Z. Ma, \"A network flow method for solving some inverse combinatorial optimization problems,\" Optimization, vol. 37, pp. 59-72, 1996.","journal-title":"Optimization"},{"key":"244020_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J. Zhang","year":"1995","unstructured":"J. Zhang, Z. Ma, and C.Yang, \"Acolumn generation method for inverse shortest path problems,\" ZORMathematical Methods of Operations Research, vol. 41, pp. 347-358, 1995.","journal-title":"ZORMathematical Methods of Operations Research"},{"key":"244020_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J. Zhang","year":"1997","unstructured":"J. Zhang, S. Xu, and Z. Ma, \"An algorithms for inverse minimum spanning tree problem,\" Optimization Methods and Software, vol. 8, pp. 69-84, 1997.","journal-title":"Optimization Methods and Software"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009883605691.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009883605691\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009883605691.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:07:33Z","timestamp":1751281653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009883605691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["244020"],"URL":"https:\/\/doi.org\/10.1023\/a:1009883605691","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}