{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T11:50:19Z","timestamp":1775476219160,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":[[1998,2]]},"DOI":"10.1007\/bf01193836","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T10:56:54Z","timestamp":1108724214000},"page":"51-58","source":"Crossref","is-referenced-by-count":38,"title":["Inverse problem of minimum cuts"],"prefix":"10.1007","volume":"47","author":[{"given":"Jianzhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mao -Cheng","family":"Cai","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. Math. Prog. 53:45?61","journal-title":"Math. Prog."},{"key":"CR2","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":"CR3","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?358","journal-title":"ZOR Math. Methods Oper. Res."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"J Zhang","year":"1996","unstructured":"Zhang J, Liu Z, Ma Z (1996) On the inverse problem of minimum spanning tree with partition constraints. ZOR Math. Methods Oper. Res. 44:171?187","journal-title":"ZOR Math. Methods Oper. Res."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J Zhang","year":"1996","unstructured":"Zhang J, Liu Z (1996) Calculating some inverse linear programming problems. J. Comp. & Appl. Math 72:261?273","journal-title":"J. Comp. & Appl. Math"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"J Zhang","year":"1996","unstructured":"Zhang J, Ma Z (1996) A network flow method for solving some inverse combinatorial optimization problems. Optimization 37:59?72","journal-title":"Optimization"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01193863","volume":"45","author":"M Cai","year":"1997","unstructured":"Cai M, Li Y (1997) Inverse matroid intersection problem. ZOR Math. Methods Oper. Res. 45:235?243","journal-title":"ZOR Math. Methods Oper. Res."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"C Yang","year":"1997","unstructured":"Yang C, Zhang J, Ma Z (1997) Inverse maximum flow and minimum cut problems. Optimization 40:147?170","journal-title":"Optimization"},{"key":"CR9","unstructured":"Yang X Inverse minimum cut problems. Working paper, Institute of Systems Science, Academia Sinica, Beijing, China"},{"key":"CR10","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":"CR11","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":"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":"113","DOI":"10.1090\/psapm\/010\/0114759","volume":"10","author":"AJ Hoffman","year":"1960","unstructured":"Hoffman AJ (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proc. Symposium on Appl. Math. 10:113?127","journal-title":"Proc. Symposium on Appl. Math."}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01193836\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:09:21Z","timestamp":1556629761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01193836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["BF01193836"],"URL":"https:\/\/doi.org\/10.1007\/bf01193836","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}