ILP ==> 0,1 ILP ==>SAT
- From: "Thomas A. Li" <tli@xxxxxxxxxxxxx>
- Date: Fri, 24 Jun 2005 16:18:24 -0400
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
.
- Follow-Ups:
- Re: ILP ==> 0,1 ILP ==>SAT
- From: Keith Ramsay
- Re: ILP ==> 0,1 ILP ==>SAT
- Prev by Date: Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- Next by Date: Re: ZFC
- Previous by thread: Oh, forgot other question regarding regular expressions
- Next by thread: Re: ILP ==> 0,1 ILP ==>SAT
- Index(es):