{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:09:50Z","timestamp":1762322990380},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":[[1998,5]]},"DOI":"10.1007\/bf01580084","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:37:08Z","timestamp":1114681028000},"page":"263-280","source":"Crossref","is-referenced-by-count":4,"title":["Diagnosing infeasibilities in network flow problems"],"prefix":"10.1007","volume":"81","author":[{"given":"Charu C.","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Ravindra K.","family":"Ahuja","sequence":"additional","affiliation":[]},{"given":"Jianxiu","family":"Hao","sequence":"additional","affiliation":[]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(81)90177-6","volume":"8","author":"J.N.M. Loon Van","year":"1981","unstructured":"J.N.M. Van Loon, Irreducibly inconsistent systems of linear inequalities, European Journal of Operations Research 8 (1981) 283\u2013288.","journal-title":"European Journal of Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","volume":"3","author":"J.W. Chinneck","year":"1991","unstructured":"J.W. Chinneck, E.E. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA Journal of Computing 3 (1991) 157\u2013168.","journal-title":"ORSA Journal of Computing"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1093\/imaman\/2.1.39","volume":"4","author":"H.J. Greenberg","year":"1988","unstructured":"H.J. Greenberg, Diagnosing infeasibility of min-cost network flow models, Part II, Primal infeasibility, IMA Journal of Mathematics in Business and Industry 4 (1988) 39\u201350.","journal-title":"IMA Journal of Mathematics in Business and Industry"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/inte.23.6.120","volume":"23","author":"H.J. Greenberg","year":"1993","unstructured":"H.J. Greenberg, How to analyze the results of linear programs \u2014 Part 3: Infeasibility diagnosis, Interfaces 23 (1993) 120\u2013139.","journal-title":"Interfaces"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D. Gale","year":"1957","unstructured":"D. Gale, A theorem on flows in networks, Pacific Journal of Mathematics 7 (1957) 1073\u20131082.","journal-title":"Pacific Journal of Mathematics"},{"key":"CR6","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"CR7","unstructured":"J. Hao, J.B. Orlin, A faster algorithm for finding the minimum cut in a graph. Proceedings of the Third Annual ACM-Siam Symposium on Discrete Algorithms, 1992, pp. 165\u2013174 (expanded version accepted for publication by the Journal of Algorithms)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"G. Gallo, M.D. Gridoriadis, R.E. Tarjan, A fast parametric flow algorithm, SIAM Journal of Computing 18 (1989) 30\u201355.","journal-title":"SIAM Journal of Computing"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"A.V. Goldberg, R.E. Tarjan, A new approach to the maximum flow problem, Journal of the ACM 35 (1988) 921\u2013940.","journal-title":"Journal of the ACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01415937","volume":"33","author":"U. Derigs","year":"1989","unstructured":"U. Derigs, W. Meier, Implementing Goldberg's max-flow algorithm: A computational investigation, Zeitschrift f\u00fcr Operations Research 33 (1989) 383\u2013403.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1137\/0218072","volume":"6","author":"J. Cheriyan","year":"1989","unstructured":"J. Cheriyan, S.N. Maheshwari, Analysis of preflow push algorithms for maximum network flow, SIAM Journal on Computing 6 (1989) 1057\u20131086.","journal-title":"SIAM Journal on Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"24","author":"D.D. Sleator","year":"1983","unstructured":"D.D. Sleator, R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences 24 (1983) 362\u2013391.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.S. Garey","year":"1989","unstructured":"M.S. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1989."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580084.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580084\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:09:13Z","timestamp":1556896153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["BF01580084"],"URL":"https:\/\/doi.org\/10.1007\/bf01580084","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}