Hypervolume Subset Selection with Small Subsets.

Evolutionary Computation(2019)

引用 11|浏览33
暂无评分
摘要
The hypervolume subset selection problem (HSSP) aims at approximating a set of n multidimensional points in Rd with an optimal subset of a given size. The size k of the subset is a parameter of the problem, and an approximation is considered best when it maximizes the hypervolume indicator. This problem has proved popular in recent years as a procedure for multiobjective evolutionary algorithms. E...
更多
查看译文
关键词
Hypervolume subset selection,hypervolume contributions,minimal triples in weighted hypergraphs.
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要