Plateaus can be harder in multi-objective optimization
type: Item
instance of: scholarly article
title: Plateaus can be harder in multi-objective optimization
zbMATH Open document ID: 1191.68827
author: Tobias Friedrich
author: Nils Hebbinghaus
author: F. Neumann
published in: Theoretical Computer Science
publication date: 2010-02-19T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5673188
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: runtime analysis
describes a project that uses: SPEA2
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.06.020
OpenAlex ID: W2138894958
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q4451071
cites work: Multi-objective optimization using evolutionary algorithms
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Multicriteria Optimization
cites work: Comparison of simple diversity mechanisms on plateau functions
cites work: Q4418669
cites work: Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
cites work: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
cites work: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
cites work: Minimum spanning trees made easier via multi-objective optimization
cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
cites work: Random orders
cites work: STACS 2005
DOI: 10.1016/J.TCS.2009.06.020
description: scientific article; zbMATH DE number 5673188