Exact and approximate determination of the Pareto front using Minimal Correction Subsets

Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira

Abstract: Highlights•Formulate Multi-Objective Boolean Optimization (MOBO) problems as MaxSAT problems.•Approximate encodings of the objective functions for MaxSAT.•Proof of the equivalence between nondominated points and Minimal Correction Subsets.•New approximation algorithms for MOBO problems with a priori guarantee.•An experimental study comparing the proposed algorithms with state-of-the-art ones.