On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
Year of publication: |
2025
|
---|---|
Authors: | Figueira, José Rui ; Klamroth, Kathrin ; Stiglmayr, Michael ; Sudhoff Santos, Julia |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 61.2025, Art.-No. 107302, p. 1-7
|
Subject: | Combinatorial optimization | Complexity theory | Multi-objective unconstrained optimization | Ordinal optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Scheduling-Verfahren | Scheduling problem |
-
Slavitt, Isaac, (2023)
-
Ordinal optimization through multi-objective reformulation
Klamroth, Kathrin, (2023)
-
Distributed localized bi-objective search
Derbel, Bilel, (2014)
- More ...
-
On the multicriteria allocation problem
Stiglmayr, Michael, (2014)
-
Multicriteria 0-1 knapsack problems with k-min objectives
Rong, Aiying, (2013)
-
Bi-dimensional knapsack problems with one soft constraint
Schulze, Britta, (2017)
- More ...