2 papers
cs.AI2022
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization
João Cortes, Inês Lynce, Vasco Manquinho
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 Satisf…
cs.AI2022
Exact and approximate determination of the Pareto set using minimal correction subsets
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten +4
Recently, it has been shown that the enumeration of Minimal Correction Subsets (MCS) of Boolean formulas allows solving Multi-Objective Boolean Optimization (MOBO) formulations. Ho…