{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:44:55Z","timestamp":1764251095555},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2004,7,7]],"date-time":"2004-07-07T00:00:00Z","timestamp":1089158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10107-004-0520-0","type":"journal-article","created":{"date-parts":[[2004,7,7]],"date-time":"2004-07-07T07:56:11Z","timestamp":1089186971000},"page":"249-259","source":"Crossref","is-referenced-by-count":15,"title":["A linear algorithm for integer programming in the plane"],"prefix":"10.1007","volume":"102","author":[{"given":"F.","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\ufffdren","family":"Laue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,7,7]]},"reference":[{"key":"CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading: Addison-Wesley, 1974"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1287\/moor.24.3.728","volume":"24","author":"Banaszczyk","year":"3","unstructured":"Banaszczyk, W., Litvak, A.E., Pajor, A., Szarek, S.J.: The flatness theorem for nonsymmetric convex bodies via the local theory of Banach spaces. Math. Oper. Res. 24 (3), 728?750 (1999)","journal-title":"Math. Oper. Res."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A course in convexity. vol. 54 of Graduate Studies in Mathematics. Providence, RI: Am. Math. Soc. 2002","DOI":"10.1090\/gsm\/054"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las Vegas algorithms for linear and integer programming when the dimension is small. J. Assoc. Comput. Mach. 42, 488?499 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: Fast integer programming in fixed dimension. In: Proceedings of the 11th Annual European Symposium on Algorithms, ESA? 2003, G.D. Battista, U. Zwick (eds.), vol. 2832 of LNCS, Springer, 2003. To appear in Computing","DOI":"10.1007\/978-3-540-39658-1_20"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Rote, G.: Fast 2-variable integer programming. In: Integer Programming and Combinatorial Optimization, IPCO 2001, K. Aardal, B. Gerards (eds.), vol. 2081 of LNCS, Springer, 2001, pp. 78?89","DOI":"10.1007\/3-540-45535-3_7"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0020-0190(00)00186-1","volume":"79","author":"Eisenbrand","year":"3","unstructured":"Eisenbrand, F.: Short vectors of planar lattices via continued fractions. Inf. Proc. Lett. 79 (3), 121?126 (2001)","journal-title":"Inf. Proc. Lett."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/2422.322417","volume":"31","author":"Feit","year":"1","unstructured":"Feit, S.D.: A fast algorithm for the two-variable integer programming problem. J. Assoc. Comput. Mach. 31 (1), 99?113 (1984)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Gau\u00df, C.F.: Disquisitiones arithmeticae. Gerh. Fleischer Iun., 1801","DOI":"10.5479\/sil.324926.39088000932822"},{"key":"CR10","first-page":"147","volume":"23","author":"Wong","year":"1","unstructured":"Hirschberg D.S., Wong, C.K.: A polynomial algorithm for the knapsack problem in two variables. J. Assoc. Comput. Mach. 23 (1), 147?154 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1142\/S0218195994000069","volume":"4","author":"Kanamaru","year":"1","unstructured":"Kanamaru, N., Nishizeki, T., Asano, T.: Efficient enumeration of grid points in a convex polygon and its application to integer programming. Inter. J. Comput. Geo. Appl. 4 (1), 69?85 (1994)","journal-title":"Inter. J. Comput. Geo. Appl."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"Lov\u00e1sz","year":"1988","unstructured":"Kannan R., Lov\u00e1sz, L.: Covering minima and lattice-point-free convex bodies. An. Math. 128, 577?602 (1988)","journal-title":"An. Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"Kannan","year":"1","unstructured":"Kannan, R.: A polynomial algorithm for the two-variable integer programming problem. J. Assoc. Comp. Mach. 27 (1), 118?122 (1980)","journal-title":"J. Assoc. Comp. Mach."},{"key":"CR14","unstructured":"Khintchine, A.Y.: Continued Fractions. Noordhoff, Groningen, 1963"},{"key":"CR15","unstructured":"Knuth, D.: The art of computer programming. vol. 2. Addison-Wesley, 1969"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","volume":"1","author":"Lagarias","year":"1980","unstructured":"Lagarias, J.C.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algor. 1, 142?186 (1980)","journal-title":"J. Algor."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"Lenstra","year":"4","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8 (4), 538?548 (1983)","journal-title":"Math. Oper. Res."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. Assoc. Comp. Mach. 31, 114?127 (1984)","journal-title":"J. Assoc. Comp. Mach."},{"key":"CR19","first-page":"1","volume":"49","author":"Scarf","year":"1981","unstructured":"Scarf, H.E.: Production sets with indivisibilities. Part I: generalities. Econometrica 49, 1?32 (1981)","journal-title":"Part I: generalities. Econometrica"},{"key":"CR20","first-page":"395","volume":"49","author":"Scarf","year":"1981","unstructured":"Scarf, H.E.: Production sets with indivisibilities. Part II: The case of two activities. Econometrica 49, 395?423 (1981)","journal-title":"Part II: The case of two activities. Econometrica"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: Fast reduction and composition of binary quadratic forms. In: Inter. Symp. Symb. Alg. Comp. ISSAC 91, ACM Press, 1991, pp. 128?133","DOI":"10.1145\/120694.120711"},{"key":"CR22","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, 1986"},{"key":"CR23","first-page":"1132","volume":"20","author":"Zamanskij","year":"1984","unstructured":"Zamanskij, L.Y., Cherkasskij, V.D.: A formula for determining the number of integral points on a straight line and its application. Ehkon. Mat. Metody (in Russian). 20, 1132?1138 (1984)","journal-title":"Ehkon. Mat. Metody (in Russian)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0520-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0520-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0520-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T13:08:50Z","timestamp":1585832930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0520-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,7]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["520"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0520-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,7,7]]}}}