printlogo
ETH Zuerich - Homepage
Systems Optimization (SOP)
 
Search

Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne graphische Elemente dargestellt. Die Funktionalität der Website ist aber trotzdem gewährleistet. Wenn Sie diese Website regelmässig benutzen, empfehlen wir Ihnen, auf Ihrem Computer einen aktuellen Browser zu installieren. Weitere Informationen finden Sie auf
folgender Seite.

Important Note:
The content in this site is accessible to any browser or Internet device, however, some graphics will display correctly only in the newer versions of Netscape. To get the most out of our site we suggest you upgrade to the latest Netscape.
More information

ETH Zürich - D-ITET - TIK - Publications
print page
  
this webpage might no longer be updated more...

Publications - Runtime Analyses

[1 — broc2009c]
D. Brockhoff. Theoretical Aspects of Evolutionary Multiobjective Optimization—A Review. Rapport de Recherche RR-7030, INRIA Saclay—Île-de-France, September 2009. (bibtex) (online access)
[2 — bfhk2009a]
D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, and E. Zitzler. On the Effects of Adding Objectives to Plateau Functions. IEEE Transactions on Evolutionary Computation, 13(3):591–603, 2009. (doi) (bibtex)
[3 — broc2009b]
D. Brockhoff. Many-Objective Optimization and Hypervolume-Based Search. PhD thesis, ETH Zurich, 2009. (bibtex)
[4 — bfn2008a]
D. Brockhoff, T. Friedrich, and F. Neumann. Analyzing Hypervolume Indicator Based Algorithms. In G. Rudolph et al., editors, Conference on Parallel Problem Solving From Nature (PPSN X), volume 5199 of LNCS, pages 651–660. Springer, 2008. (PDF) (bibtex) (online access)
[5 — bfhk2007a]
D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, and E. Zitzler. Do Additional Objectives Make a Problem Harder?. In D. Thierens et al., editors, Genetic and Evolutionary Computation Conference (GECCO 2007), pages 765–772, New York, NY, USA, 2007. ACM Press. (PDF) (bibtex) (online access)
[6 — bz2007d]
D. Brockhoff and E. Zitzler. Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem. In K. H. Waldmann and U. M. Stocker, editors, Operations Research Proceedings 2006, pages 423–429. Springer, 2007. (PDF) (bibtex) (online access) (suppl. material)
[7 — bz2007a]
D. Brockhoff and E. Zitzler. Offline and Online Objective Reduction in Evolutionary Multiobjective Optimization Based on Objective Conflicts. TIK Report 269, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, April 2007. (PDF) (bibtex) (suppl. material)
[8 — bz2006d]
D. Brockhoff and E. Zitzler. Are All Objectives Necessary? On Dimensionality Reduction in Evolutionary Multiobjective Optimization. In T. P. Runarsson et al., editors, Conference on Parallel Problem Solving from Nature (PPSN IX), volume 4193 of LNCS, pages 533–542, Berlin, Germany, 2006. Springer. (PDF) (bibtex) (online access) (suppl. material)
[9 — bz2006c]
D. Brockhoff and E. Zitzler. Dimensionality Reduction in Multiobjective Optimization with (Partial) Dominance Structure Preservation: Generalized Minimum Objective Subset Problems. TIK Report 247, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, April 2006. (PDF) (bibtex) (suppl. material)
[10 — ltz2006a]
M. Laumanns, L. Thiele, and E. Zitzler. An Efficient, Adaptive Parameter Variation Scheme for Metaheuristics Based on the Epsilon-Constraint Method. European Journal of Operational Research, 169(3):932–942, March 2006. (PDF) (bibtex)
[11 — bz2006a]
D. Brockhoff and E. Zitzler. On Objective Conflicts and Objective Reduction in Multiple Criteria Optimization. TIK Report 243, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, February 2006. (PDF) (bibtex) (suppl. material)
[12 — ltz2004b]
M. Laumanns, L. Thiele, and E. Zitzler. Running Time Analysis of Evolutionary Algorithms on a Simplified Multiobjective Knapsack Problem. Natural Computing, 3(1):37–51, 2004. (PDF) (bibtex)
[13 — ltz2004a]
M. Laumanns, L. Thiele, and E. Zitzler. Running Time Analysis of Multiobjective Evolutionary Algorithms on Pseudo-Boolean Functions. IEEE Transactions on Evolutionary Computation, 8(2):170–182, 2004. (PDF) (bibtex)
[14 — ltz2003d]
M. Laumanns, L. Thiele, and E. Zitzler. Running Time Analysis of Evolutionary Algorithms on Vector-Valued Pseudo-Boolean Functions. TIK Report 165, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, May 2003. (PDF) (bibtex)
[15 — ltzw2002b]
M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb. Running Time Analysis of Multi-Objective Evolutionary Algorithms on a Simple Discrete Optimization Problem. In Conference on Parallel Problem Solving From Nature (PPSN VII), volume 2439 of LNCS, pages 44–53. Springer, 2002. (PDF) (bibtex)
[16 — ltzw2002a]
M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb. Running Time Analysis of a Multi-Objective Evolutionary Algorithm on a Simple Discrete Optimization Problem. TIK Report 123, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, January 2002. (PDF) (bibtex)
top
© 2018 Institut TIK, ETH Zürich | Imprint | Last updated: Thu, 15 Aug 2019 10:13 | Valid XHTML 1.0! Valid CSS! Valid XHTML 1.0
!!! Dieses Dokument stammt aus dem ETH Web-Archiv und wird nicht mehr gepflegt !!!
!!! This document is stored in the ETH Web archive and is no longer maintained !!!