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, (2024)
-
Belhoul, Lyes, (2014)
-
Optimizing a linear function over an efficient set
Belkhiri, Hadjer, (2022)
- More ...
-
On the rectangular knapsack problem : approximation of a specific quadratic knapsack problem
Schulze, Britta, (2020)
-
Compressed data structures for bi-objective {0,1}-knapsack problems
Correia, Pedro, (2018)
-
Representation of the non-dominated set in biobjective discrete optimization
Vaz, Daniel, (2015)
- More ...