Exact MAX-2SAT solution via lift-and-project closure

We present a new approach for exact solution of MAX-2SAT problems based on a strong reformulation deduced from an optimal continuous solution over the elementary closure of lift-and-project cuts. Computational results show that this formulation leads to a reduced number of nodes in the branch-and-bound tree and short computing times.

[1]  Etienne de Klerk,et al.  Semidefinite Programming Approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives , 2002 .

[2]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[3]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[4]  Simon de Givry,et al.  Solving Max-SAT as Weighted CSP , 2003, CP.

[5]  Egon Balas,et al.  Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..

[6]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[7]  John E. Mitchell,et al.  A branch and cut algorithm for MAX-SAT and weighted MAX-SAT , 1996, Satisfiability Problem: Theory and Applications.

[8]  Gérard Cornuéjols,et al.  Elementary closures for integer programs , 2001, Oper. Res. Lett..

[9]  Rolf Niedermeier,et al.  Faster Exact Solutions for MAX2SAT , 2000, CIAC.

[10]  Felip Manyà,et al.  Exact Algorithms for MAX-SAT , 2003, FTP.

[11]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[14]  William H. Cunningham,et al.  A linear programming and rounding approach to max 2-sat , 1993, Cliques, Coloring, and Satisfiability.

[15]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .