Integer Programming with 2-Variable Equations and 1-Variable Inequalities

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(N2 ) where N is the number of bits in the input.

• Type: Conference
• Year: 2009
• Where: COLOGNETWENTE
• Authors: Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
• Keywords: COLOGNETWENTE 2007, COLOGNETWENTE 2009, Linear Objective Function, Optimal Integer Solution, Worst-case Running Time