On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem

DOI10.1007/978-3-642-14186-7_19zbMath1306.68172OpenAlexW1591355225MaRDI QIDQ4930591

Denis Pankratov, Allan Borodin

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_19

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS

This page was built for publication: On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem