Stochastic convergence of random search methods to fixed size Pareto front approximations
type: Item
instance of: scholarly article
title: Stochastic convergence of random search methods to fixed size Pareto front approximations
zbMATH Open document ID: 1222.90054
author: Rico Zenklusen
author: Marco Laumanns
published in: European Journal of Operational Research
publication date: 2011-06-22T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5910996
zbMATH Keywords: multiple criteria analysis
zbMATH Keywords: metaheuristics
zbMATH Keywords: search theory
describes a project that uses: SMS-EMOA
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.03.039
OpenAlex ID: W2015549289
cites work: The space complexity of approximating the frequency moments
cites work: SMS-EMOA: multiobjective selection based on dominated hypervolume
cites work: Q4223058
cites work: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
cites work: Approximating the volume of unions and intersections of high-dimensional geometric objects
cites work: Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
cites work: A (slightly) faster algorithm for klee's measure problem
cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
cites work: Approximating Multiobjective Knapsack Problems
cites work: Q3790956
cites work: On the convergence of multiobjective evolutionary algorithms
cites work: A multiobjective evolutionary algorithm for approximating the efficient set
cites work: Q3888874
cites work: On several concepts for \(\varepsilon\)-efficiency
cites work: Q4817402
cites work: Approximately dominating representatives
cites work: Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
cites work: An approximation method for the efficiency set of multiobjective programming problems
cites work: \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
cites work: Convergence of stochastic search algorithms to finite size Pareto set approximations
DOI: 10.1016/J.EJOR.2011.03.039
description: scientific article; zbMATH DE number 5910996