Exploiting set-based structures to accelerate dynamic programming algorithms for the elementary shortest path problem with resource constraints
Year of publication: |
2013
|
---|---|
Authors: | Range, Troels Martin |
Publisher: |
Odense : Univ. of Southern Denmark |
Subject: | Dynamische Optimierung | Dynamic programming | Algorithmus | Algorithm | Graphentheorie | Graph theory |
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
-
Multiple hypernode hitting sets and smallest two-cores with targets
Damaschke, Peter, (2009)
- More ...
-
A Benders decomposition-based Matheuristic for the Cardinality Constrained Shift Design Problem
Lusby, Richard Martin, (2015)
-
A column generation approach for solving the patient admission scheduling problem
Range, Troels Martin, (2014)
-
A column generation approach for solving the patient admission scheduling problem
Range, Troels Martin, (2013)
- More ...