Implicit enumeration strategies for the hypervolume subset selection problem
From MaRDI portal
Recommendations
- Exact hypervolume subset selection through incremental computations
- Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems
- Don't be greedy when calculating hypervolume contributions
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- A box decomposition algorithm to compute the hypervolume indicator
Cites work
- scientific article; zbMATH DE number 1975103 (Why is no real title available?)
- A box decomposition algorithm to compute the hypervolume indicator
- An analysis of approximations for maximizing submodular set functions—I
- Approximating the volume of unions and intersections of high-dimensional geometric objects
- Maximum volume subset selection for anchored boxes
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- Representation of the non-dominated set in biobjective discrete optimization
- SMS-EMOA: multiobjective selection based on dominated hypervolume
Cited in
(3)
This page was built for publication: Implicit enumeration strategies for the hypervolume subset selection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782182)