Illustration of fairness in evolutionary multi-objective optimization
DOI10.1016/J.TCS.2010.09.023zbMATH Open1211.90209OpenAlexW2003869546MaRDI QIDQ633692FDOQ633692
Authors: Tobias Friedrich, F. Neumann, Christian Thyssen 
Publication date: 29 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.023
Recommendations
- The concept of \(B\)-efficient solution in fair multiobjective optimization problems
- On the convergence of multiobjective evolutionary algorithms
- Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts
- scientific article; zbMATH DE number 2102225
- Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29)
Cites Work
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Don't be greedy when calculating hypervolume contributions
- Theory of the hypervolume indicator: optimal \(\mu\)-distributions and the choice of the reference point
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- Minimum spanning trees made easier via multi-objective optimization
- On the analysis of the \((1+1)\) evolutionary algorithm
- Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
Cited In (2)
Uses Software
This page was built for publication: Illustration of fairness in evolutionary multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633692)
