Illustration of fairness in evolutionary multi-objective optimization
From MaRDI portal
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
Cites work
- Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- Don't be greedy when calculating hypervolume contributions
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
- Minimum spanning trees made easier via multi-objective optimization
- On the analysis of the \((1+1)\) evolutionary algorithm
- Theory of the hypervolume indicator: optimal \(\mu\)-distributions and the choice of the reference point
- Upper and lower bounds for randomized search heuristics in black-box optimization
Cited in
(2)
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)