Discrete optimization with decision diagrams
Year of publication: |
2016
|
---|---|
Authors: | Bergman, David ; Cire, Andre A. ; Hoeve, Willem-Jan van ; Hooker, J. N. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 1, p. 47-66
|
Subject: | programming | integer | branch and bound | dynamic programming | deterministic | networks/graphs | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming |
-
Discrete nonlinear optimization by state-space decompositions
Bergman, David, (2018)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
A branch-and-price algorithm for production routing problems with carbon cap-and-trade
Qiu, Yuzhuo, (2017)
- More ...
-
Optimization bounds from binary decision diagrams
Bergman, David, (2014)
-
Hybrid optimization methods for time-dependent sequencing problems
Kinable, Joris, (2017)
-
On the minimum chordal completion polytope
Bergman, David, (2019)
- More ...