Very fast non-dominated sorting
From MaRDI portal
Recommendations
- Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU
- Advances in Artificial Intelligence
- Approximate non-dominated sorting for evolutionary many-objective optimization
- Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU/CPU platforms
- Non-dominated rank based sorting genetic algorithms
Cited in
(14)- Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU
- A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model
- A PDE-based approach to nondominated sorting
- Non-dominated rank based sorting genetic algorithms
- scientific article; zbMATH DE number 4110087 (Why is no real title available?)
- Solving a kind of high complexity multi-objective problems by a fast algorithm
- Solution of a set of linear inequalities by NSGA-II
- Fast Sorting and Pattern-Avoiding Permutations
- A fast incremental BSP tree archive for non-dominated points
- Adaptive non-dominated sorting genetic algorithm
- Evolutionary Multi-Criterion Optimization
- Advances in Artificial Intelligence
- Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
- Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU/CPU platforms
This page was built for publication: Very fast non-dominated sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825666)