Search Results for author:
Found 2 papers, 0 papers with code
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization
In the last decade, a plethora of algorithms for single-objective Boolean optimization has been proposed that rely on the iterative usage of a highly effective Propositional Satisfiability (SAT) solver.
Exact and approximate determination of the Pareto set using minimal correction subsets
First, we show that it is possible to use MCS enumeration to solve MOBO problems such that each MCS necessarily corresponds to a Pareto-optimal solution.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
