| F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity (2008) | |||||||||||||||||
Abstract | |||||||||||||||||
| In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experimental studies show that additional objectives may change the runtime behavior of an algorithm drastically. Often it is assumed that more objectives make a problem harder as the number of different trade-offs may increase with the problem dimension. We show that additional objectives, however, may be both beneficial and obstructive depending on the chosen objective. Our results are obtained by rigorous runtime analyses that show the different effects of adding objectives to a well-known plateau-function. | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||