1 paper · 1 filter
Hannes Ihalainen, Andy Oertel, Yong Kiam Tan +3
Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimizatio…