Fast 2-variable integer programming

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

Volumn 2081, Issue , 2001, Pages 78-89

  Eisenbrand, Friedrich ^a   Rote, Günter ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

ARITHMETIC OPERATIONS; BIT INTEGERS; BIT-OPERATIONS; INTEGER PROGRAM;

INTEGER PROGRAMMING;

EID: 84947221101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_7     Document Type: Conference Paper

References (22)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.
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. Short vectors of planar lattices via continued fractions. Information Processing Letters, 2001. to appear. http://www.mpi-sb.mpg.de/~eisen/report_lattice.ps.gz
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. 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-154, 1976.
6. N. Kanamaru, T. Nishizeki, and T. Asano. Ecient enumeration of grid points in a convex polygon and its application to integer programming. Int. J. Comput. Geom. Appl., 4(1):69-85, 1994.
7. R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12(3):415-440, 1987.
8. R. Kannan and L. Lovasz. Covering minima and lattice-point-free convex bodies. Annals of Mathematics, 128:577-602, 1988.
9. Ravindran Kannan. A polynomial algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery, 27(1):118-122, 1980.
10. D. E. Knuth. The Art of Computer Programming, volume 2. Addison-Wesley, 1969.
11. J. C. Lagarias. Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. Journal of Algorithms, 1:142-186, 1980.
12. H. W. Lenstra. Integer programming with a xed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983.
13. N. Megiddo. Linear time algorithms for linear programming in R3 and related problems. SIAM Journal on Computing, 12:759-776, 1983.
14. N. Megiddo. Linear programming in linear time when the dimension is xed. Journal of the Association for Computing Machinery, 31:114-127, 1984.
15. H. E. Scarf. Production sets with indivisibilities. Part I: generalities. Econometrica, 49:1-32, 1981.
16. H. E. Scarf. Production sets with indivisibilities. Part II: The case of two activities. Econometrica, 49:395-423, 1981.
17. A. Schönhage. Schnelle Berechnung von Kettenbruchentwicklungen. (Fast computation of continued fraction expansions). Acta Informatica, 1:139-144, 1971.
18. A. Schönhage. Fast reduction and composition of binary quadratic forms. In International Symposium on Symbolic and Algebraic Computation, ISSAC 91, pages 128-133. ACM Press, 1991.
19. A. Schonhage and V. Strassen. Schnelle Multiplikation groer Zahlen (Fast multiplication of large numbers). Computing, 7:281-292, 1971.
20. A. Schrijver. Theory of Linear and Integer Programming. John Wiley, 1986.
21. C. K. Yap. Fast unimodular reduction: Planar integer lattices. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 437-446, Pittsburgh, 1992.
22. 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-1138, 1984.