Integer programming with 2-variable equations and 1-variable inequalities

Authors:
Manuel Bodirsky;Gustav Nordh;Timo von Oertzen
Affiliations:
École Polytechnique, LIX (CNRS UMR 7161), Palaiseau, France;Department of Computer and Information Science, Linköping University, Linköping, Sweden;Max Planck Institute for Human Development, Berlin, Germany
Venue:
Information Processing Letters
Year:
2009

Citing 3
Cited 3

Asymptotically fast computation of Hermite normal forms of integer matrices

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A linear algorithm for integer programming in the plane

Mathematical Programming: Series A and B

Presenting Constraints

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Discrete-time temporal reasoning with horn DLRs

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Computational complexity of linear constraints over the integers

Artificial Intelligence

Quantified Score

Hi-index	0.90

Visualization

Abstract

We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objective function. Our algorithm has worst-case running time in O(N^2) where N is the number of bits in the input.