Approximate Pareto sets of minimal size for multi-objective optimization problems
Year of publication: |
2015
|
---|---|
Authors: | Bazgan, Cristina ; Jamain, Florian ; Vanderpooten, Daniel |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 1, p. 1-6
|
Subject: | Multi-objective optimization | Pareto set | Non-dominated points | Approximation algorithm | Greedy algorithm | Theorie | Theory | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Pareto-Optimum | Pareto efficiency |
-
Bazgan, Cristina, (2017)
-
Sadouki, Sami Chibani, (2019)
-
Approximation methods for multiobjective optimization problems : a survey
Herzel, Arne, (2021)
- More ...
-
Bazgan, Cristina, (2017)
-
Satisfactory graph partition, variants, and generalizations
Bazgan, Cristina, (2010)
-
Critical edges for the assignment problem : complexity and exact resolution
Bazgan, Cristina, (2013)
- More ...