Hashemi, S. MehdiKoch, RonaldNasrabadi, EbrahimSkutella, Martin2021-12-172021-12-1720102197-8085https://depositonce.tu-berlin.de/handle/11303/15689http://dx.doi.org/10.14279/depositonce-14462Dynamic network flow problems model the temporal evolution of flows over time and also consider changes of network parameters such as capacities, costs, supplies, and demands over time. These problems have been extensively studied in the past because of their important role in real world applications such as transport, traffic, and logistics. This has led to many results, but the more challenging continuous time model still lacks some of the key features such as network related optimality conditions and algorithms that are available in the static case.en510 Mathematikdynamic network flowscontinuous linear programmingaugmenting paths and cyclesoptimality conditionsdualitycycle-canceling algorithmResearch Paper