Why dominance is not enough: lessons from practical evolutionary multi-objective algorithms
From MaRDI portal
Cites work
- Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
- Analyzing evolutionary algorithms. The computer science perspective.
- Black-box Complexity of Parallel Search with Distributed Populations
- Black-box search by unbiased variation
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
- Faster black-box algorithms through higher arity operators
- From black-box complexity to designing new genetic algorithms
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Introduction to algorithms.
- Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On the analysis of the \((1+1)\) evolutionary algorithm
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Theory of evolutionary computation. Recent developments in discrete optimization
- Upper and lower bounds for randomized search heuristics in black-box optimization
This page was built for publication: Why dominance is not enough: lessons from practical evolutionary multi-objective algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354553)
