Journal of Automated Reasoning

, Volume 51, Issue 1, pp 79–108

Cutting to the Chase

Solving Linear Integer Arithmetic


    • New York University
  • Leonardo de Moura
    • Microsoft Research

DOI: 10.1007/s10817-013-9281-x

Cite this article as:
Jovanović, D. & de Moura, L. J Autom Reasoning (2013) 51: 79. doi:10.1007/s10817-013-9281-x


We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.


Linear arithmeticSMTSATDPLLLinear programmingInteger arithmetic

Copyright information

© Springer Science+Business Media Dordrecht 2013