Representation of the non-dominated set in biobjective discrete optimization

This paper introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective discrete optimization problem with respect to uniformity, coverage and the ¿-indicator. We consider the representation problem itself as multiobjective, trying to find a good compromise between these quality measures. These representation problems are formulated as particular facility location problems with a special location structure, which allows for polynomial-time algorithms in the biobjective case based on the principles of dynamic programming and threshold approaches. In addition, we show that several multiobjective variants of these representation problems are also solvable in polynomial time. Computational results obtained by these approaches on a wide range of randomly generated point sets are presented and discussed. HighlightsWe formulate the representation problem in two dimensions for three different measures: uniformity, coverage, and ¿-indicator.We present algorithms that solve the representation problems for the three measures in polynomial time.We consider multiobjective variants of representation problems, and present polynomial time algorithms to solve them.We present and discuss experimental results for all the problems.