Computational results on an LP and rounding approach to Max 2SAT
- Univ. of Waterloo (Canada)
Given (0,1) variables and a set of clauses having at most two literals per clause, the max 2-sat problem is to find an assignment that maximizes the number (or weight) of the satisfied clauses. We discuss computational results on an LP based cutting plane approach to max 2-sat. Our main algorithm finds upper bounds from the LP relaxations with two families of cuts, namely, cycle inequalities and wheel inequalities. Furthermore, it employs a rounding procedure (due to D. S. Johnson and others) to convert a fractional l.p. solution to a (0,1) solution. We performed computational experiments on random max 2-sat instances having up to 800 variables, as well as max 2-sat instances obtained by transforming instances of the max cut, max stable set, and satisfiability problems. We also tested four variants of Johnson`s rounding algorithm. Our computational results show that for random max 2-sat instances, the algorithm finds assignments within 1% of optimal.
- OSTI ID:
- 35897
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering