A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic

DOI10.1007/978-3-642-31365-3_8zbMath1358.68249OpenAlexW2126774253MaRDI QIDQ2908479

Assia Mahboubi, Mohamed Iguernelala, Sylvain Conchon, Evelyne Contejean, François Bobot, Guillaume Melquiond, Alain Mebsout

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31365-3_8

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Extreme-point and pivoting methods (90C49)

Related Items

New techniques for linear arithmetic: cubes and equalities, $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation, Fast Cube Tests for LIA Constraint Solving

Uses Software

• MIPLIB2003