Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
From MaRDI portal
Publication:3636864
DOI10.1007/978-3-642-02658-4_20zbMath1242.65116OpenAlexW1545415851MaRDI QIDQ3636864
Isil Dillig, Alex Aiken, Thomas Dillig
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_20
Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (10)
Proof tree preserving tree interpolation ⋮ Satisfiability Modulo Theories ⋮ Linear Integer Arithmetic Revisited ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ Cutting to the Chase Solving Linear Integer Arithmetic ⋮ Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic ⋮ Fast Cube Tests for LIA Constraint Solving ⋮ SPASS-SATT. A CDCL(LA) solver ⋮ A complete and terminating approach to linear integer solving ⋮ Cutting to the chase.
Uses Software
This page was built for publication: Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
