{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:51Z","timestamp":1759335531404},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6772,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0012-365x(93)e0168-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:16Z","timestamp":1027616836000},"page":"223-240","source":"Crossref","is-referenced-by-count":1,"title":["Max-balanced flows in oriented matroids"],"prefix":"10.1016","volume":"137","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":"78","reference":[{"key":"10.1016\/0012-365X(93)E0168-4_bib1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(78)90080-1","article-title":"Orientability of matroids","volume":"24","author":"Bland","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)E0168-4_bib2","article-title":"Algebraic and Combinatorial Methods in Operations Research","volume":"Vol. 19","author":"Burkard","year":"1984"},{"key":"10.1016\/0012-365X(93)E0168-4_bib3","series-title":"Modern Applied Mathematics \u2014 Optimization and Operations Research","first-page":"391","article-title":"Combinatorial optimization in linearly ordered semimodules: A survey","author":"Burkard","year":"1982"},{"key":"10.1016\/0012-365X(93)E0168-4_bib4","article-title":"Minimax Algebra","volume":"Vol. 166","author":"Cuninghame-Green","year":"1979"},{"key":"10.1016\/0012-365X(93)E0168-4_bib5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(80)90052-9","article-title":"Algebraic flows in regular matroids","volume":"2","author":"Hamacher","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)E0168-4_bib6","series-title":"Discrete Structures and Algorithms","first-page":"153","article-title":"Maximal algebraic flows: Algorithms and examples","author":"Hamacher","year":"1980"},{"key":"10.1016\/0012-365X(93)E0168-4_bib7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0120919","article-title":"Minimal cost flows in regular matroids","volume":"14","author":"Hamacher","year":"1981","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0012-365X(93)E0168-4_bib8","article-title":"Flows in Regular Matroids","volume":"Vol. 69","author":"Hamacher","year":"1981"},{"key":"10.1016\/0012-365X(93)E0168-4_bib9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02249936","article-title":"Decomposition of group flows in regular matroids","volume":"29","author":"Hamacher","year":"1982","journal-title":"Computing"},{"key":"10.1016\/0012-365X(93)E0168-4_bib10","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01581095","article-title":"An analogue of Hoffman's circulation theorem for max-balanced flows","volume":"57","author":"Hartmann","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(93)E0168-4_bib11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/nav.3800100131","article-title":"On abstract dual linear programs","volume":"10","author":"Hoffman","year":"1963","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0012-365X(93)E0168-4_bib12","first-page":"597","article-title":"Two-commodity flow","volume":"23","author":"Itai","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(93)E0168-4_bib13","volume":"Vol. 6","author":"Recski","year":"1989"},{"key":"10.1016\/0012-365X(93)E0168-4_bib14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","article-title":"A theorem on graphs, with an application to a problem of traffic control","volume":"46","author":"Robbins","year":"1939","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(93)E0168-4_bib15","series-title":"Combinatorial Mathematics and Its Applications Proc. the Chapel Hill Conf.","first-page":"104","article-title":"The elementary vectors of a subspace of Rn","author":"Rockafellar","year":"1969"},{"key":"10.1016\/0012-365X(93)E0168-4_bib16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(92)90179-E","article-title":"Characterizations of max-balanced flows","volume":"39","author":"Rothblum","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)E0168-4_bib17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895479891222088","article-title":"Scaling matrices to prescribed row and column maxima","volume":"15","author":"Rothblum","year":"1994","journal-title":"SIAM J. Matrix Anal., Appl."},{"key":"10.1016\/0012-365X(93)E0168-4_bib18","article-title":"An l\u221e balancing of a weighted directed graph","author":"Schneider","year":"1987"},{"key":"10.1016\/0012-365X(93)E0168-4_bib19","first-page":"159","article-title":"Towers and cycle covers for max-balanced graphs","volume":"73","author":"Schneider","year":"1990"},{"key":"10.1016\/0012-365X(93)E0168-4_bib20","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/moor.16.1.208","article-title":"Max-balancing weighted directed graphs and matrix scaling","volume":"16","author":"Schneider","year":"1991","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0012-365X(93)E0168-4_bib21","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230210206","article-title":"Faster parametric shortest path and minimum-balance algorithms","volume":"21","author":"Young","year":"1991","journal-title":"Networks"},{"key":"10.1016\/0012-365X(93)E0168-4_bib22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0024-3795(80)90004-X","article-title":"Duality for algebraic linear programming","volume":"32","author":"Zimmermann","year":"1981","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0012-365X(93)E0168-4_bib23","article-title":"Linear and Combinatorial Optimization in Ordered Algebraic Structures","volume":"Vol. 10","author":"Zimmermann","year":"1981"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E01684?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E01684?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T07:58:16Z","timestamp":1556179096000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E01684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0012365X93E01684"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0168-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}