{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:11:35Z","timestamp":1761621095507},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603139"},{"type":"electronic","value":"9783540449133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_164","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:17:21Z","timestamp":1330280241000},"page":"473-483","source":"Crossref","is-referenced-by-count":37,"title":["0\/1-Integer programming: Optimization and Augmentation are equivalent"],"prefix":"10.1007","author":[{"given":"Andreas S.","family":"Schulz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter M.","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"35_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin: Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs NJ, 1993."},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Jack Edmonds and Richard M. Karp: Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the Association for Computing Machinery 19 (1972), 248\u2013264.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Andr\u00e1s Frank and \u00c9va Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization, Combinatorica 7 (1987), 49\u201365.","journal-title":"Combinatorica"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H. N. Gabow","year":"1985","unstructured":"Harold N. Gabow: Scaling algorithms for network problems, Journal of Computer and System Sciences 31 (1985), 148\u2013168.","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Martin Gr\u00f6tschel and L\u00e1szl\u00f3 Lov\u00e1sz: Combinatorial Optimization, Chapter 28 of the Handbook on Combinatorics, R. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz (eds.), to appear.","key":"35_CR5"},{"key":"35_CR6","volume-title":"Algorithms and Combinatorics 2","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Martin Gr\u00f6tschel, L\u00e1szl\u00f3 Lov\u00e1sz, and Alexander Schrijver: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics 2, Springer, Berlin, 1988; Second edition 1993.","edition":"Second edition"},{"key":"35_CR7","volume-title":"CBMS-NSF Regional Conference Series in Applied Mathematics 50","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz: An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics 50, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1986."},{"key":"35_CR8","first-page":"181","volume-title":"Discrete Structures and Algorithms","author":"H. R\u00f6ck","year":"1980","unstructured":"Hans R\u00f6ck: Scaling techniques for minimal cost network flows, in: V. Page (ed.), Discrete Structures and Algorithms, Carl Hanser, Munich, 1980, pp. 181\u2013191."},{"key":"35_CR9","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Alexander Schrijver: Theory of Linear and Integer Programming, John Wiley & Sons, Chichester, 1986."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_164.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:08Z","timestamp":1619573828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_164","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}