Solving MAX-SAT and Weighted MAX-SAT Problems Using Branch-and-Cut (1998)
| Citations: | 5 - 2 self |
BibTeX
@MISC{Joy98solvingmax-sat,
author = {Steve Joy and John E. Mitchell and Brian Borchers},
title = {Solving MAX-SAT and Weighted MAX-SAT Problems Using Branch-and-Cut},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a branch and cut algorithm for both MAX-SAT and weighted MAX-SAT. This algorithm uses the GSAT procedure as a primal heuristic. At each nodewe solve a linear programming (LP) relaxation of the problem. Two styles of separating cuts are added: resolution cuts and odd cycle inequalities. We compare our algorithm to an extension of the Davis Putnam Loveland (EDPL) algorithm and a Semi-Definite Programming (SDP) approach. Our algorithm is more effective than EDPL on some problems, notably MAX-2-SAT. EDPL and SDP are more effective on some other classes of problems.
