Enumeration of the nondominated set of multiobjective discrete optimization problems
Year of publication: |
2021
|
---|---|
Authors: | Tamby, Satya ; Vanderpooten, Daniel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 1, p. 72-85
|
Subject: | multiobjective optimization | combinatorial optimization | nondominated points | ε-constraint | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis |
-
Quasi-Newton methods for multiobjective optimization problems
Morovati, Vahid, (2018)
-
Nikas, Alexandros, (2022)
-
Lenovo schedules laptop manufacturing using deep reinforcement learning
Liang, Yi, (2022)
- More ...
-
One-exact approximate Pareto sets
Herzel, Arne, (2020)
-
Solving efficiently the 0-1 multi-objective knapsack problem
Bazgan, Cristina, (2009)
-
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
Bazgan, Cristina, (2009)
- More ...