Refine
Year of publication
- 2014 (1) (remove)
Document Type
- Preprint (1) (remove)
Language
- English (1) (remove)
Has Fulltext
- yes (1)
Keywords
- Approximation (1) (remove)
Faculty / Organisational entity
A new algorithm for optimization problems with three objective functions is presented which computes a representation for the set of nondominated points. This representation is guaranteed to have a desired coverage error and a bound on the number of iterations needed by the algorithm to meet this coverage error is derived. Since the representation does not necessarily contain nondominated points only, ideas to calculate bounds for the representation error are given. Moreover, the incorporation of domination during the algorithm and other quality measures are discussed.