Implicit enumeration strategies for the hypervolume subset selection problem

DOI10.1016/J.COR.2018.07.003zbMath1458.90574OpenAlexW2810027848WikidataQ129575207 ScholiaQ129575207MaRDI QIDQ1782182

Ricardo J. Gomes, Luís Paquete, Andreia P. Guerreiro, Tobias Kuhn

Publication date: 18 September 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.003

zbMATH Keywords

branch and boundmultiobjective optimizationinteger linear programminghypervolume indicatorhypervolume subset selection problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (2)

Exact hypervolume subset selection through incremental computations ⋮ Computing representations using hypervolume scalarizations

Uses Software

• SCIP
• SMS-EMOA
• HypE

Cites Work

• Representation of the non-dominated set in biobjective discrete optimization
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• A box decomposition algorithm to compute the hypervolume indicator
• An analysis of approximations for maximizing submodular set functions—I
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: Implicit enumeration strategies for the hypervolume subset selection problem