Implicit enumeration strategies for the hypervolume subset selection problem
Year of publication: |
December 2018
|
---|---|
Authors: | Gomes, Ricardo J. ; Guerreiro, Andreia P. ; Kuhn, Tobias ; Paquete, Luís F. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 100.2018, p. 244-253
|
Subject: | Hypervolume indicator | Branch and bound | Multiobjective optimization | Hypervolume subset selection problem | Integer linear programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Branch-and-Bound | Branch and Bound |
-
Augmenting bi-objective branch and bound by scalarization-based information
Bauß, Julius C., (2024)
-
Belhoul, Lyes, (2014)
-
Optimizing a linear function over an efficient set
Belkhiri, Hadjer, (2022)
- More ...
-
Greedy algorithms for a class of knapsack problems with binary weights
Gorski, Jochen, (2012)
-
Paquete, Luís F., (2009)
-
Representation of the non-dominated set in biobjective discrete optimization
Vaz, Daniel, (2015)
- More ...