Fast Integer Programming in Fixed Dimension

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 196-207

  Eisenbrand, Friedrich ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS; ENCODING (SYMBOLS);

ARITHMETIC OPERATIONS; BINARY ENCODINGS; BINARY SEARCH; FIXED NUMBERS; INTEGER PROGRAM; RANDOM SAMPLING; RUNNING TIME; S-ALGORITHMS;

INTEGER PROGRAMMING;

EID: 0142183804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_20     Document Type: Article

References (17)

1. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 601-610. ACM Press, 2001.
2. 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-499, 1995.
3. F. Eisenbrand and G. Rote. Fast 2-variable integer programming. In K. Aardal and B. Gerards, editors, Integer Programming and Combinatorial Optimization, IPCO 2001, volume 2081 of LNCS, pages 78-89. Springer, 2001.
4. S. D. Feit. A fast algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery, 31(1):99-113, 1984.
5. A. Frank and E. Tardos. An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica, 7:49-65, 1987.
6. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, 1979.
7. B. Gärtner and E. Welzl. Linear programming - randomization and abstract frameworks. In STACS 96 (Grenoble, 1996), volume 1046 of Lecture Notes in Comput. Sci., pages 669-687. Springer, Berlin, 1996.
8. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, 1988.
9. R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12(3):415-440, 1987.
10. R. Kannan and L. Lovász. Covering minima and lattice-point-free convex bodies. Annals of Mathematics, 128:577-602, 1988.
11. D. Knuth. The art of computer programming, volume 2. Addison-Wesley, 1969.
12. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Annalen, 261:515 - 534, 1982.
13. H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538 - 548, 1983.
14. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley, 1988.
15. A. Schrijver. Theory of Linear and Integer Programming. John Wiley, 1986.
16. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
17. L. Y. Zamanskij and V. D. Cherkasskij. A formula for determining the number of integral points on a straight line and its application. Ehkon. Mat. Metody, 20:1132-1138, 1984.