Stochastic convergence of random search methods to fixed size Pareto front approximations
From MaRDI portal
Publication:545118
DOI10.1016/j.ejor.2011.03.039zbMath1222.90054OpenAlexW2015549289MaRDI QIDQ545118
Rico Zenklusen, Marco Laumanns
Publication date: 22 June 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.03.039
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Non-dominated sorting on performance indicators for evolutionary many-objective optimization ⋮ Anytime Pareto local search ⋮ Minimizing the area of a Pareto confidence region ⋮ Bi-goal evolution for many-objective optimization problems ⋮ Covers and approximations in multiobjective optimization ⋮ On the estimation of Pareto fronts from the point of view of copula theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- A multiobjective evolutionary algorithm for approximating the efficient set
- Approximately dominating representatives
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Approximating the volume of unions and intersections of high-dimensional geometric objects
- The space complexity of approximating the frequency moments
- On several concepts for \(\varepsilon\)-efficiency
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- On the convergence of multiobjective evolutionary algorithms
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- Approximating Multiobjective Knapsack Problems
- Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
- An approximation method for the efficiency set of multiobjective programming problems
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- A (slightly) faster algorithm for klee's measure problem
This page was built for publication: Stochastic convergence of random search methods to fixed size Pareto front approximations
