Accepted paper at CPAIOR 2019

The work proposes core-boosted linear search, a generic search-strategy that combines two central approaches to Boolean optimization solving via maximum satisfiability.

The paper Core-Boosted Linear Search for Incomplete MaxSAT by Jeremias Berg, Emir Demirovíc, and Peter J. Stuckey, with co-authors from University of Melbourne and Monash University, Australia, has been accepted for publication in the proceedings of the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019). The paper proposes core-boosted linear search as a generic search-strategy that combines two central approaches in modern MaxSAT solving: linear and core-guided algorithms. The work was done during Jeremias' research visit to Melbourne.