Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT

Abstract

We present novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, and provide experimental evidence that outperform the algorithm of Borchers & Furman on Max-2-SAT and weighted Max-2-SAT instances. Our algorithms decrease the time needed to solve an instance, as well as the number of backtracks, up to two orders of magnitude.

DOI: 10.1007/978-3-540-45193-8_115

Extracted Key Phrases

Statistics

0510'04'06'08'10'12'14'16
Citations per Year

56 Citations

Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Planes2003ImprovedBA, title={Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT}, author={Jordi Planes}, booktitle={CP}, year={2003} }