Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
| Year of publication: |
1 August 2017
|
|---|---|
| Authors: | Bazgan, Cristina ; Jamain, Florian ; Vanderpooten, Daniel |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 260.2017, 3 (1.8.), p. 814-827
|
| Subject: | Multiple objective programming | Pareto set | Non-dominated points | Discrete representation | Exact and approximation algorithms | kernel | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Core | Algorithmus | Algorithm |
-
Approximate Pareto sets of minimal size for multi-objective optimization problems
Bazgan, Cristina, (2015)
-
Sadouki, Sami Chibani, (2019)
-
Hartillo-Hermoso, María Isabel, (2020)
- More ...
-
Approximate Pareto sets of minimal size for multi-objective optimization problems
Bazgan, Cristina, (2015)
-
Solving efficiently the 0-1 multi-objective knapsack problem
Bazgan, Cristina, (2009)
-
Min-max and min-max regret versions of combinatorial optimization problems : a survey
Aissi, Hassene, (2009)
- More ...