Share This Author
MaxSAT-Based Bi-Objective Boolean Optimization
A maximum satisfiability (MaxSAT) based approach to bi-objective optimization which allows for enumerating all Pareto-optimal solutions and empirically compares the efficiency of the approach to recent competing approaches.
MaxSAT-Based Bi-Objective Boolean 1 Optimization 2
This work explores a maximum satisﬁability (MaxSAT) based approach to bi-objective optimization and empirically compares the eﬃciency of the approach to recent competing approaches, showing practical bene⬁ts of this approach in the contexts of learning interpretable classi ﬁcation rules and bi- objective set covering.