Article ID Journal Published Year Pages File Type
1142853 Operations Research Letters 2006 7 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Exact MAX-2SAT solution via lift-and-project closure
Authors
, ,