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

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00421751
Contributor : Pierre Bonami <>
Submitted on : Saturday, October 3, 2009 - 11:43:18 AM
Last modification on : Wednesday, May 15, 2019 - 3:50:58 AM

Identifiers

Citation

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

Share

Metrics

Record views

195