Resource-Constrained Heuristic for Max-SAT

Brian Matejek, Daniel Elenius, Cale Gentry +2

We propose a resource-constrained heuristic for instances of Max-SAT that iteratively decomposes a larger problem into smaller subcomponents that can be solved by optimized solvers…