{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:29:22Z","timestamp":1781584162114,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1007\/bf02579200","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:14:06Z","timestamp":1174598046000},"page":"49-65","source":"Crossref","is-referenced-by-count":229,"title":["An application of simultaneous diophantine approximation in combinatorial optimization"],"prefix":"10.1007","volume":"7","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02579200_CR1","unstructured":"R. E. Bixby, O. M.-C. Marcotte andL. E. Trotter, Jr., Packing and covering with integral flows in integral supply-demand networks,Report No. 84327\u2014OR, Institut f\u00fcr \u00d6konometrie und Operations Research, University Bonn, Bonn, West Germany."},{"key":"BF02579200_CR2","volume-title":"An Introduction to the Theory of Numbers","author":"J. W. S. Cassels","year":"1971","unstructured":"J. W. S. Cassels,An Introduction to the Theory of Numbers, Berlin, Heidelberg, New York, Springer, 1971."},{"key":"BF02579200_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W. H. Cunningham","year":"1984","unstructured":"W. H. Cunningham, Testing membership in matroid polyhedra,Journal of Combinatorial Theory B,36 (1984), 161\u2013188.","journal-title":"Journal of Combinatorial Theory B"},{"key":"BF02579200_CR4","doi-asserted-by":"crossref","unstructured":"W. H. Cunningham andA. Frank, A primal dual algorithm for submodular flows,Mathematics of Operations Research.,10 (1985).","DOI":"10.1287\/moor.10.2.251"},{"key":"BF02579200_CR5","first-page":"1277","volume":"11","author":"E. A. Dinits","year":"1970","unstructured":"E. A. Dinits, Algorithm for solution of a problem of maximum flow in a network with power estimation,Soviet Math. Dokl.,11 (1970), 1277\u20131280.","journal-title":"Soviet Math. Dokl."},{"key":"BF02579200_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69 B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Minimum partition of a matroid into independent subsets,Research of the Nat. Bureau of Standards 69 B (1965), 67\u201372.","journal-title":"Research of the Nat. Bureau of Standards"},{"key":"BF02579200_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71 B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, System of distinct representatives and linear algebra,J. Res. Nat. Bur. Standards,71 B (1967), 241\u2013245.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"BF02579200_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs,Annals of Discrete Mathematics,1 (1977), 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02579200_CR9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds andR. M. Karp, Theoretical improvements in the algorithmic efficiency for network flow problems,J. ACM,19 (1972), 248\u2013264.","journal-title":"J. ACM"},{"key":"BF02579200_CR10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF01580882","volume":"35","author":"S. Fujishige","year":"1986","unstructured":"S. Fujishige, A capacity rounding algorithm for the minimum-cost circulation problem: a dual framework of the Tardos algorithm,Mathematical Programming,35 (1986), 298\u2013309.","journal-title":"Mathematical Programming"},{"key":"BF02579200_CR11","doi-asserted-by":"crossref","unstructured":"Z. Galil and\u00c9. Tardos, AnO(n 2(m+n logn)\u00b7logn) minimum cost flow algorithm,in: Proc., 27th Annual Symposium on Foundations of Computer Science (1986), 1\u20139.","DOI":"10.1109\/SFCS.1986.7"},{"key":"BF02579200_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz andA. Schrijver, The ellipsoid method and its consequences in combinatorial optimization.Combinatorica,1 (1981), 169\u2013197.","journal-title":"Combinatorica"},{"key":"BF02579200_CR13","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz andA. Schrijver,The ellipsoid method and combinatorial optimization, Springer Verlag,to appear."},{"key":"BF02579200_CR14","unstructured":"R. Kannan, Improved algorithms for integer programming and related lattice problems,in: Proc.,15 th Annual ACM Symposium on the Theory of Computing (1983), 193\u2013206.Final version: Minkowski\u2019s Convex Body Theorem and Integer Programming, Carnegie-Mellon University,Report No. 86\u2013105."},{"key":"BF02579200_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr. andL. Lov\u00e1sz, Factoring polynomials with rational coefficients,Math. Ann.,261 (1982), 515\u2013534.","journal-title":"Math. Ann."},{"key":"BF02579200_CR16","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra Jr.","year":"1983","unstructured":"H. W. Lenstra, Jr., Integer programming with a fixed number of variables,Math. of Operations Research,8 (1983), 538\u2013548.","journal-title":"Math. of Operations Research"},{"key":"BF02579200_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9. Tardos","year":"1985","unstructured":"\u00c9. Tardos, A strongly polynomial minimum cost circulation algorithm,Combinatorica,5 (1985), 247\u2013255.","journal-title":"Combinatorica"},{"key":"BF02579200_CR18","doi-asserted-by":"crossref","unstructured":"\u00c9. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs,Operations Research, (1986), No. 2","DOI":"10.1287\/opre.34.2.250"},{"key":"BF02579200_CR19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0166-218X(82)90053-1","volume":"4","author":"U. Zimmermann","year":"1982","unstructured":"U. Zimmermann, Minimization of submodular flows,Discrete Applied Math.,4 (1982), 303\u2013323.","journal-title":"Discrete Applied Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579200.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579200\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:59Z","timestamp":1558197899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["BF02579200"],"URL":"https:\/\/doi.org\/10.1007\/bf02579200","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}