{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:47:09Z","timestamp":1764251229516},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422259"},{"type":"electronic","value":"9783540455356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45535-3_7","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:51Z","timestamp":1265899191000},"page":"78-89","source":"Crossref","is-referenced-by-count":6,"title":["Fast 2-Variable Integer Programming"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,21]]},"reference":[{"key":"7_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K. L. Clarkson","year":"1995","unstructured":"K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the Association for Computing Machinery, 42:488\u2013499, 1995.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"F. Eisenbrand. Short vectors of planar lattices via continued fractions. Information Processing Letters, 2001. to appear. \n                  http:\/\/www.mpisb.mpg.de\/~eisen\/ report_lattice.ps.gz","DOI":"10.1016\/S0020-0190(00)00186-1"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/2422.322417","volume":"31","author":"S. D. Feit","year":"1984","unstructured":"S. D. Feit. A fast algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery, 31(1):99\u2013113, 1984.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"7_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"D. S. Hirschberg","year":"1976","unstructured":"D. S. Hirschberg and C. K. Wong. A polynomial algorithm for the knapsack problem in two variables. Journal of the Association for Computing Machinery, 23(1):147\u2013154, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0218195994000069","volume":"4","author":"N. Kanamaru","year":"1994","unstructured":"N. Kanamaru, T. Nishizeki, and T. Asano. Efficient enumeration of grid points in a convex polygon and its application to integer programming. Int. J. Comput. Geom. Appl., 4(1):69\u201385, 1994.","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"R. Kannan. Minkowski\u2019s convex body theorem and integer programming. Mathe-matics of Operations Research, 12(3):415\u2013440, 1987.","journal-title":"Mathe-matics of Operations Research"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R. Kannan","year":"1988","unstructured":"R. Kannan and L. Lov\u00e1sz. Covering minima and lattice-point-free convex bodies. Annals of Mathematics, 128:577\u2013602, 1988.","journal-title":"Annals of Mathematics"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"R. Kannan","year":"1980","unstructured":"Ravindran Kannan. A polynomial algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery, 27(1): 118\u2013122, 1980.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR10","unstructured":"D. E. Knuth. The Art of Computer Programming, volume 2. Addison-Wesley, 1969."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","volume":"1","author":"J. C. Lagarias","year":"1980","unstructured":"J. C. Lagarias. Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. Journal of Algorithms, 1:142\u2013186, 1980.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"7_CR12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra","year":"1983","unstructured":"H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538\u2013548, 1983.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Linear time algorithms for linear programming in R3 and related problems. SIAM Journal on Computing, 12:759\u2013776, 1983.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the Association for Computing Machinery, 31:114\u2013127, 1984.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1911124","volume":"49","author":"H. E. Scarf","year":"1981","unstructured":"H. E. Scarf. Production sets with indivisibilities. Part I: generalities. Econometrica, 49:1\u201332, 1981.","journal-title":"Part I: generalities. Econometrica"},{"key":"7_CR16","first-page":"395","volume":"49","author":"H. E. Scarf","year":"1981","unstructured":"H. E. Scarf. Production sets with indivisibilities. Part II: The case of two activities.Econometrica, 49:395\u2013423, 1981.","journal-title":"Part II: The case of two activities.Econometrica"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage. Schnelle Berechnung von Kettenbruchentwicklungen. (Fast computation of continued fraction expansions). Acta Informatica, 1:139\u2013144, 1971.","journal-title":"Acta Informatica"},{"key":"7_CR18","first-page":"128","volume":"91","author":"A. Sch\u00f6nhage","year":"1991","unstructured":"A. Sch\u00f6nhage. Fast reduction and composition of binary quadratic forms. In International Symposium on Symbolic and Algebraic Computation, ISSAC 91, pages 128\u2013133. ACM Press, 1991.","journal-title":"In International Symposium on Symbolic and Algebraic Computation, ISSAC"},{"key":"7_CR19","first-page":"281","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage and V. Strassen. Schnelle Multiplikation gro_er Zahlen (Fast multiplication of large numbers). Computing, 7:281\u2013292, 1971.","journal-title":"Schnelle Multiplikation gro_er Zahlen (Fast multiplication of large numbers). Computing"},{"key":"7_CR20","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley, 1986."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"C. K. Yap. Fast unimodular reduction: Planar integer lattices. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 437\u2013446, Pittsburgh, 1992.","DOI":"10.1109\/SFCS.1992.267808"},{"key":"7_CR22","first-page":"1132","volume":"20","author":"L. Ya. Zamanskij","year":"1984","unstructured":"L. Ya. Zamanskij and V. D. Cherkasskij. A formula for determining the number of integral points on a straight line and its application. Ehkonomika i Matematicheskie Metody, 20:1132\u20131138, 1984.","journal-title":"Ehkonomika i Matematicheskie Metody"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45535-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T10:58:49Z","timestamp":1551005929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45535-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422259","9783540455356"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45535-3_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}