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

13 years 5 months ago

Download www.ida.liu.se

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.

Manuel Bodirsky, Gustav Nordh, Timo von Oertzen

Real-time Traffic

COLOGNETWENTE 2007 | COLOGNETWENTE 2009 | Linear Objective Function | Optimal Integer Solution | Worst-case Running Time |

claim paper

» Strengthening latticefree cuts using nonnegativity

» A Sequent Calculus for Integer Arithmetic with Counterexample Generation

» Certificates of linear mixed integer infeasibility

» Control of systems integrating logic dynamics and constraints

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2009
Where	COLOGNETWENTE
Authors	Manuel Bodirsky, Gustav Nordh, Timo von Oertzen

Comments (0)

Sciweavers

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

COLOGNETWENTE 2007 | COLOGNETWENTE 2009 | Linear Objective Function | Optimal Integer Solution | Worst-case Running Time |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers