{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:36:53Z","timestamp":1777520213180,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf01193863","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:14:55Z","timestamp":1108736095000},"page":"235-243","source":"Crossref","is-referenced-by-count":19,"title":["Inverse Matroid Intersection Problem"],"prefix":"10.1007","volume":"45","author":[{"given":"Cai","family":"Mao-Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Mathematical Programming 53:45?61","journal-title":"Mathematical Programming"},{"key":"CR2","first-page":"242","volume-title":"Inverse shortest path problems","author":"M Cai","year":"1995","unstructured":"Cai M, Yang X (1995) Inverse shortest path problems. Proc. Internat. Symp. on Operations Research with Applications in Technology and Management, ISORA'95, Beijing: 242?248"},{"key":"CR3","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford LR, Fulkerson DR (1962) Flows in Networks. Princeton University Press, Princeton, N.J."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A Frank","year":"1981","unstructured":"Frank A (1981) A weighted matroid intersection algorithm. J. Algorithms 2:328?336","journal-title":"J. Algorithms"},{"key":"CR5","volume-title":"A strongly polynomial algorithm for the inverse shortest arborescence problem. Working paper","author":"Z Hu","year":"1994","unstructured":"Hu Z, Liu Z (1994) A strongly polynomial algorithm for the inverse shortest arborescence problem. Working paper, Institute of Systems Science, Academia Sinica, Beijing, China"},{"key":"CR6","unstructured":"Huang S, Liu Z (1994) On the inverse problem of fc-matching of bipartite graph. Working paper, Department of Management, School of Business and Management, Hong Kong University of Science and Technology"},{"key":"CR7","volume-title":"Combinatorial optimization: Networks and matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winsteon, New York"},{"key":"CR8","unstructured":"Ma Z, Xu S, Zhang J (1994) Algorithms for inverse minimum spanning tree problem, Working paper, Department of Mathematics, City Polytechnic of Hong Kong"},{"key":"CR9","unstructured":"Ma Z, Zhang J (1995) On inverse combinatorial optimization problems. Working paper, Department of Mathematics, City Polytechnic of Hong Kong"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Orlin JB (1988) A faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Symp. on the Theory of Comp.: 377?387","DOI":"10.21236\/ADA457044"},{"key":"CR11","volume-title":"Combinatorial optimization: Algorithms and complexity","author":"H Papadimitriou","year":"1982","unstructured":"Papadimitriou H, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs, N.J."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E Tardos","year":"1985","unstructured":"Tardos E (1985) A strongly polynomial minimum cost circulation algorithm. Combinatorica 5:247?255","journal-title":"Combinatorica"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34:250?256","journal-title":"Operations Research"},{"key":"CR14","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. Indust. Appl. Math. 12:47?59","journal-title":"Japan J. Indust. Appl. Math."},{"key":"CR15","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 ? Mathematical Methods of Operations Research 41:347?358","journal-title":"ZOR ? Mathematical Methods of Operations Research"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193863.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01193863\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:09:22Z","timestamp":1556629762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01193863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF01193863"],"URL":"https:\/\/doi.org\/10.1007\/bf01193863","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}