Network models for multiobjective discrete optimization
Year of publication: |
2022
|
---|---|
Authors: | Bergman, David ; Bodur, Merve ; Cardonha, Carlos ; Cire, Andre A. |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 990-1005
|
Subject: | decision analysis | dynamic programming | generalized networks | integer programming | multiple criteria | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Entscheidung | Decision | Dynamische Optimierung | Dynamic programming |
-
Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
Fennich, M. Eliass, (2024)
-
Slavitt, Isaac, (2023)
-
Dynamic programming algorithms for the bi-objective integer knapsack problem
Rong, Aiying, (2014)
- More ...
-
Discrete nonlinear optimization by state-space decompositions
Bergman, David, (2018)
-
On the minimum chordal completion polytope
Bergman, David, (2019)
-
Bergman, David, (2023)
- More ...