Pseudo boolean rounding sat

Question

Sometimes problems requiring pseudoboolean solving appear

(solve a system of linear inequalities where each variable is 0 or 1)

currently i was advised to use http://www.csc.kth.se/~jakobn/RoundingSat/, but if you know any better code (or if you can help me understanding this code so that i might understand which problems it solves better, and which worse, and maybe modify it to do better on our problems) that would be nice. This problem has minimal priority -- for now i can just use a ready code.

Answer 1

Are you saying that you are trying to find a better way to code solving a liner equation once it is in reduced row eschilon form?