{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:31:20Z","timestamp":1680435080306},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1007\/bf01581095","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:15Z","timestamp":1114681935000},"page":"459-476","source":"Crossref","is-referenced-by-count":4,"title":["An analogue of Hoffman's circulation conditions for max-balanced flows"],"prefix":"10.1007","volume":"57","author":[{"given":"Mark","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael H.","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Algebraic and Combinatorial Methods in Operations Research. Annals of Discrete Mathematics No. 19","author":"R.E. Burkard","year":"1984","unstructured":"R.E. Burkard, R.A. Cuninghame-Green and U. Zimmermann,Algebraic and Combinatorial Methods in Operations Research. Annals of Discrete Mathematics No. 19 (North-Holland, Amsterdam, 1984)."},{"key":"CR2","volume-title":"Modern Applied Mathematics \u2014 Optimization and Operations Research","author":"R.E. Burkard","year":"1982","unstructured":"R.E. Burkard and U. Zimmermann, \u201cCombinatorial optimization in linearly ordered semimodules: A survey,\u201d in: Bernhard Korte, ed.,Modern Applied Mathematics \u2014 Optimization and Operations Research (North-Holland, Amsterdam, 1982)."},{"key":"CR3","volume-title":"Minimax Algebra. Lecture Notes in Economics and Mathematical Systems No. 166","author":"R. Cuninghame-Green","year":"1970","unstructured":"R. Cuninghame-Green,Minimax Algebra. Lecture Notes in Economics and Mathematical Systems No. 166 (Springer, Berlin, 1970)."},{"issue":"11","key":"CR4","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R.B. Dial","year":"1969","unstructured":"R.B. Dial and A.M. Voorhees, \u201cAlgorithm 360: Shortest-path forest with topological ordering,\u201dCommunications of the ACM 12(11) (1969) 632\u2013633.","journal-title":"Communications of the ACM"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and D.R. Fulkerson, \u201cBottleneck extrema,\u201dJournal of Combinatorial Theory 8 (1970) 299\u2013306.","journal-title":"Journal of Combinatorial Theory"},{"issue":"2","key":"CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems,\u201dJournal of the Association of Computing Machinery 19(2) (1972) 248\u2013264.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.21136\/CMJ.1975.101334","volume":"25","author":"G.M. Engel","year":"1975","unstructured":"G.M. Engel and H. Schneider, \u201cDiagonal similarity and equivalence for matrices over groups with 0,\u201dCzechoslovak Mathematical Journal 25 (1975) 389\u2013403.","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran and R. E. Tarjan, \u201cAugmentation problems,\u201dSIAM Journal on Computing 5(4) (1976) 653\u2013665.","journal-title":"SIAM Journal on Computing"},{"key":"CR9","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford, Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R. Endre Tarjan, \u201cFibonacci heaps and their use in improved network optimization algorithms,\u201dJournal of the Association of Computing Machinery 34 (1987) 596\u2013615.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(80)90052-9","volume":"2","author":"H. Hamacher","year":"1980","unstructured":"H. Hamacher, \u201cAlgebraic flows in regular matroids,\u201dDiscrete Applied Mathematics 2 (1980) 27\u201338.","journal-title":"Discrete Applied Mathematics"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02249936","volume":"29","author":"H. Hamacher","year":"1982","unstructured":"H. Hamacher, \u201cDecomposition of group flows in regular matroids,\u201dComputing 29 (1982) 113\u2013133.","journal-title":"Computing"},{"key":"CR14","first-page":"153","volume-title":"Discrete Structures and Algorithms","author":"H. Hamacher","year":"1980","unstructured":"H. Hamacher, \u201cMaximal algebraic flows: Algorithms and examples,\u201d in: U. Pape, ed.,Discrete Structures and Algorithms (Carl Hauser Verlag, Munich, 1980) pp. 153\u2013166."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0120919","volume":"14","author":"H. Hamacher","year":"1981","unstructured":"H. Hamacher, \u201cMinimal cost flows in regular matroids,\u201dMathematical Programming Studies 14 (1981) 32\u201347.","journal-title":"Mathematical Programming Studies"},{"key":"CR16","volume-title":"\u201cFlow symmetry and algebraic flows,\u201d Technical Report UNC\/OR\/TR 91-4","author":"M. Hartmann","year":"1991","unstructured":"M. Hartmann and M.H. Schneider, \u201cFlow symmetry and algebraic flows,\u201d Technical Report UNC\/OR\/TR 91-4, The University of North Carolina (Chapel Hill, NC, 1991)."},{"key":"CR17","volume-title":"\u201cMax-balanced flows in oriented matroids,\u201d OR Group Report Series","author":"M. Hartmann","year":"1991","unstructured":"M. Hartmann and M.H. Schneider, \u201cMax-balanced flows in oriented matroids,\u201d OR Group Report Series, The Johns Hopkins University (Baltimore, MD, 1991)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/nav.3800100131","volume":"10","author":"A.J. Hoffman","year":"1963","unstructured":"A.J. Hoffman, \u201cOn abstract dual linear programs,\u201dNaval Research Logistics Quarterly 10 (1963) 369\u2013373.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"A.J. Hoffman, \u201cSome recent applications of the theory of linear inequalities to extremal combinatorial analysis,\u201d in: R. Bellman and M. Hall, Jr., eds.,Combinatorial Analysis, proceedings of Symposia on Applied Mathematics, Vol. X (American Mathematical Society, 1960) pp. 113\u2013127.","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0095-8956(73)90018-X","volume":"15","author":"L. Lov\u00e1sz","year":"1973","unstructured":"L. Lov\u00e1sz, \u201cConnectivity in digraphs,\u201dJournal of Combinatorial Theory, Series B 15 (1973) 174\u2013177.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science No. 2","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn,Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science No. 2 (Springer, Berlin, 1984)."},{"issue":"5","key":"CR22","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1287\/opre.8.5.733","volume":"8","author":"M. Pollack","year":"1960","unstructured":"M. Pollack, \u201cThe maximum capacity through a network,\u201dOperations Research 8(5) (1960) 733\u2013736.","journal-title":"Operations Research"},{"issue":"2","key":"CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/opre.8.2.224","volume":"8","author":"M. Pollack","year":"1960","unstructured":"M. Pollack and W. Wiebenson, \u201cSolutions of the shortest-route problem \u2014 A review,\u201dOperations Research 8(2) (1960) 225\u2013230.","journal-title":"Operations Research"},{"key":"CR24","unstructured":"U.G. Rothblum, H. Schneider and M.H. Schneider, \u201cCharacterizations of max-balanced flows,\u201d to appear in:Discrete Applied Mathematics."},{"key":"CR25","volume-title":"\u201cAnl \u221e balancing of a weighted directed graph,\u201d OR Group Report Series #88-1","author":"H. Schneider","year":"1987","unstructured":"H. Schneider and M.H. Schneider, \u201cAnl \u221e balancing of a weighted directed graph,\u201d OR Group Report Series #88-1, The Johns Hopkins University (Baltimore, MD, 1987)."},{"issue":"1","key":"CR26","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/moor.16.1.208","volume":"16","author":"H. Schneider","year":"1991","unstructured":"H. Schneider and M.H. Schneider, \u201cMax-balancing weighted directed graphs and matrix scaling,\u201dMathematics of Operations Research 16(1) (1991) 208\u2013220.","journal-title":"Mathematics of Operations Research"},{"key":"CR27","first-page":"159","volume":"73","author":"H. Schneider","year":"1990","unstructured":"H. Schneider and M.H. Schneider, \u201cTowers and cycle covers for max-balanced graphs,\u201dCongressus Numerantium 73 (1990) 159\u2013170.","journal-title":"Congressus Numerantium"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, \u201cDepth first search and linear graph algorithms,\u201dSIAM Journal on Computing 1 (1972) 146\u2013160.","journal-title":"SIAM Journal on Computing"},{"key":"CR29","volume-title":"Data structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics No. 44","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan,Data structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics No. 44 (SIAM, Philadelphia, PA, 1983)."},{"issue":"3","key":"CR30","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"L.G. Valiant, \u201cThe complexity of enumeration and reliability problems,\u201dSIAM Journal on Computing 8(3) (1979) 410\u2013421.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"CR31","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/321921.321927","volume":"23","author":"R.A. Wagner","year":"1976","unstructured":"R.A. Wagner, \u201cA shortest path algorithm for edge-sparse graphs,\u201dJournal of the Association of Computing Machinery 23(1) (1976) 50\u201357.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0024-3795(80)90004-X","volume":"32","author":"U. Zimmermann","year":"1981","unstructured":"U. Zimmermann, \u201cDuality for algebraic linear programming,\u201dLinear Algebra and its Applications 32 (1981) 9\u201331.","journal-title":"Linear Algebra and its Applications"},{"key":"CR33","volume-title":"Linear and Combinatorial Optimization in Ordered Algebraic Structures. Annals of Discrete Mathematics No. 10","author":"U. Zimmermann","year":"1981","unstructured":"U. Zimmermann,Linear and Combinatorial Optimization in Ordered Algebraic Structures. Annals of Discrete Mathematics No. 10 (North-Holland, Amsterdam, 1981)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581095\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T03:10:27Z","timestamp":1625886627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["BF01581095"],"URL":"https:\/\/doi.org\/10.1007\/bf01581095","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}