Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets

Konstantinos Karathanasis, Spyros Kontogiannis, Christos Zaroliagis

A key task in multi-objective optimization is to compute the Pareto subset or frontier $P$ of a given $d$-dimensional objective space $F$; that is, a maximal subset $P\subseteq F$…