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

Authors:
P. Bonami;M. Minoux
Affiliations:
Carnegie Mellon University, Pittsburgh, USA;Université Paris 6, 4 Place Jussieu, 75005, Paris, France
Venue:
Operations Research Letters
Year:
2006

Citing 7
Cited 3

A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Faster Exact Solutions for MAX2SAT

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Lift-and-project for mixed 0-1 programming: recent progress

Discrete Applied Mathematics
Elementary closures for integer programs

Operations Research Letters

DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs

Discrete Applied Mathematics
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Discrete Optimization
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

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.