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

Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
2009 Information Processing Letters  
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.
doi:10.1016/j.ipl.2009.01.025 fatcat:vdbn6o2blfgjvafq6dbr2q2uwa