AUGUST 28, 2006
This presentation of the article Outer Branching: How to Optimize under Partial Orders? has been given at the 2nd Multidisciplinary Workshop on Advances in Preference Handling M-PREF 2006. It shows how to compute the non-dominated frontier of optimization problems with partial orders by reducing them to optimization problems with total orders and non-dominance constraints. ►
This web site expresses personal reflections about scientific topics with the purpose of contributing to discussions in scientific communities. As such, this content is not related to any organization, association, or employment.