Faster hypervolume-based search using Monte Carlo sampling
From MaRDI portal
Publication:3556573
Recommendations
Cited in
(17)- Hypervolume maximization via set based Newton's method
- Robustness-based approach for fuzzy multi-objective problems
- Don't be greedy when calculating hypervolume contributions
- Fast hypervolume approximation scheme based on a segmentation strategy
- A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation
- Many-objective optimization and hypervolume based search.
- Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm
- Optimizing online recurring promotions for dual-channel retailers: segmented markets with multiple objectives
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- Improved quick hypervolume algorithm
- A survey on multi-objective evolutionary algorithms for many-objective problems
- Speeding up many-objective optimization by Monte Carlo approximations
- Domination Measure: A New Metric for Solving Multiobjective Optimization
- Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
- Multi-objective optimization with an adaptive resonance theory-based estimation of distribution algorithm
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- The logarithmic hypervolume indicator
This page was built for publication: Faster hypervolume-based search using Monte Carlo sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556573)