{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:21:41Z","timestamp":1649110901475},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01580604","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:43:41Z","timestamp":1114681421000},"page":"115-123","source":"Crossref","is-referenced-by-count":4,"title":["A polynomial-time simplex method for the maximumk-flow problem"],"prefix":"10.1007","volume":"60","author":[{"given":"Donald K.","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Hong","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0927-0507(89)01005-4","volume-title":"Optimization","author":"R.K. Ahuja","year":"1989","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin, \u201cNetwork flows,\u201d in: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds.,Optimization (North-Holland, Amsterdam, 1989) pp. 211\u2013369."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(88)90193-8","volume":"72","author":"C.J. Colbourn","year":"1988","unstructured":"C.J. Colbourn, \u201cEdge-packing of graphs and network reliability,\u201dDiscrete Mathematics 72 (1988) 49\u201361.","journal-title":"Discrete Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"2","author":"P. Elias","year":"1956","unstructured":"P. Elias, A. Feinstein and C.E. Shannon, \u201cA note on the maximum flow through a network,\u201dIRE Transactions on Information Theory 2 (1956) 117\u2013119.","journal-title":"IRE Transactions on Information Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"L.R. Ford Jr. and D.R. Fulkerson, \u201cMaximal flow through a network,\u201dCanadian Journal of Mathematics 8 (1956) 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01594940","volume":"50","author":"A.V. Goldberg","year":"1991","unstructured":"A.V. Goldberg, M.D. Grigoriadis and R.E. Tarjan, \u201cUse of dynamic trees in a network simplex method for the maximum flow problem,\u201dMathematical Programming 50 (1991) 277\u2013290.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01580869","volume":"47","author":"D. Goldfarb","year":"1990","unstructured":"D. Goldfarb and J. Hao, \u201cA primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time,\u201dMathematical Programming 47 (1990) 353\u2013366.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0167-6377(91)90039-R","volume":"10","author":"D. Goldfarb","year":"1991","unstructured":"D. Goldfarb and J. Hao, \u201cOn strongly polynomial variants of the network simplex method for the maximum flow problem,\u201dOperations Research Letters 10 (1991) 383\u2013387.","journal-title":"Operations Research Letters"},{"key":"CR8","volume-title":"An algorithm for a multiple disconnecting set problem","author":"O. Nishihara","year":"1988","unstructured":"O. Nishihara and K. Inoue, \u201cAn algorithm for a multiple disconnecting set problem,\u201d unpublished manuscript, Department of Aeronautical Engineering, Kyoto University (Kyoto, 1988)."},{"key":"CR9","unstructured":"O. Nishihara, H. Kumamoto and K. Inoue, \u201cAn algorithm for a multiple cut problem and its application,\u201dThirteenth International Symposium on Mathematical Programming, Tokyo, August 1988."},{"key":"CR10","unstructured":"J.B. Orlin, private communication (January 1990)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/net.3230200402","volume":"20","author":"D.K. Wagner","year":"1990","unstructured":"D.K. Wagner, \u201cDisjoint (s, t)-cuts in a network,\u201dNetworks 20 (1990) 361\u2013371.","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580604.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580604\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:09Z","timestamp":1556896329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01580604"],"URL":"https:\/\/doi.org\/10.1007\/bf01580604","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}