| Article ID: | iaor2007950 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 4 |
| Start Page Number: | 387 |
| End Page Number: | 393 |
| Publication Date: | Jul 2006 |
| Journal: | Operations Research Letters |
| Authors: | Minoux M., Bonami P. |
| Keywords: | programming: branch and bound |
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.