pseudo-Boolean reasoning

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning

  • Gioni Mexi
  • Timo Berthold
  • Ambros Gleixner
    • Categories 0-1 Programming, Integer Programming Tags , , ,

    Conflict analysis has been successfully generalized from Boolean satisfiability (SAT) solving to mixed integer programming (MIP) solvers, but although MIP solvers operate with general linear inequalities, the conflict analysis in MIP has been limited to reasoning with the more restricted class of clausal constraint. This is in contrast to how conflict analysis is performed in … Read more