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

Pierre Bonami (1) , Michel Minoux (2)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166
2 DECISION

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.

Mots clés: Mixed-integer-programming; MAX-2SAT; Branch-and-cut; Lift-and-project

Domaines: Recherche opérationnelle [math.OC]; Optimisation et contrôle [math.OC]

Pierre Bonami, Michel Minoux. Exact MAX-2SAT solution via lift-and-project closure. Operations Research Letters, 2006, 34 (4), pp.387-393. ⟨10.1016/j.orl.2005.07.001⟩. ⟨hal-00421751⟩