Skip to main content
Conference Proceedings

Fast 2-variable integer programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2081 78-89
DOI: 10.1007/3-540-45535-3_7
11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that a 2-variable integer program defined by m constraints involving coeffcients with at most s bits can be solved with O(m+s logm) arithmetic operations or with O(m+logmlogs)M(s) bit operations, where M(s) is the time needed for s-bit integer multiplication.

Cite

CITATION STYLE

APA

Eisenbrand, F., & Rote, G. (2001). Fast 2-variable integer programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 78–89). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free