ILP ==> 0,1 ILP ==>SAT



Does anybody has any information about:

a polynomial reduction of ILP, integer linear programming, without
minimization/maximization
to 0,1 ILP and/or
finally to SAT in Boolean Logic?

Thanks in advance,

Thomas Li



.