Representation of the non-dominated set in biobjective discrete optimization
Computers & Operations Research, Volume 63, Issue C, 2015.
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 measure...More
Full Text (Upload PDF)
PPT (Upload PPT)