{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T03:10:13Z","timestamp":1785467413315,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540200642","type":"print"},{"value":"9783540396581","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_20","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:24:30Z","timestamp":1279841070000},"page":"196-207","source":"Crossref","is-referenced-by-count":30,"title":["Fast Integer Programming in Fixed Dimension"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"Proceedings of the thirty-third annual ACM symposium on Theory of computing","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 601\u2013610. ACM Press, New York (2001)"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K.L. Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las vegas algorithms for linear and integer programming when the dimension is small. Journal of the Association for Computing Machinery\u00a042, 488\u2013499 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-45535-3_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Eisenbrand","year":"2001","unstructured":"Eisenbrand, F., Rote, G.: Fast 2-variable integer programming. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 78\u201389. Springer, Heidelberg (2001)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/2422.322417","volume":"31","author":"S.D. Feit","year":"1984","unstructured":"Feit, S.D.: A fast algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery\u00a031(1), 99\u2013113 (1984)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica\u00a07, 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"20_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, San Francisco (1979)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","first-page":"669","volume-title":"STACS 96","author":"B. G\u00e4rtner","year":"1996","unstructured":"G\u00e4rtner, B., Welzl, E.: Linear programming\u2014randomization and abstract frameworks. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 669\u2013687. Springer, Heidelberg (1996)"},{"key":"20_CR8","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02. Springer, Heidelberg (1988)"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Mathematics of Operations Research\u00a012(3), 415\u2013440 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R. Kannan","year":"1988","unstructured":"Kannan, R., Lov\u00e1sz, L.: Covering minima and lattice-point-free convex bodies. Annals of Mathematics\u00a0128, 577\u2013602 (1988)","journal-title":"Annals of Mathematics"},{"key":"20_CR11","volume-title":"The art of computer programming","author":"D. Knuth","year":"1969","unstructured":"Knuth, D.: The art of computer programming, vol.\u00a02. Addison-Wesley, Reading (1969)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"K. Lenstra","year":"1982","unstructured":"Lenstra, K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Annalen"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"20_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)"},{"key":"20_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"20_CR16","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"key":"20_CR17","first-page":"1132","volume":"20","author":"L.Y. 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\u00a020, 1132\u20131138 (1984)","journal-title":"Ehkon. Mat. Metody"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T16:58:10Z","timestamp":1711645090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}