2 papers
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…
cs.DS2019
One-Exact Approximate Pareto Sets
Arne Herzel, Cristina Bazgan, Stefan Ruzika +2
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit…