TY - GEN A1 - Koch, Ronald A1 - Nasrabadi, Ebrahim T1 - Strong duality for the maximum Borel flow problem N2 - Research on flows over time has been conducted mainly in two separate and mainly independent approaches, namely \emph{discrete} and \emph{continuous} models, depending on whether a discrete or continuous representation of time is used. Recently, Borel flows have been introduced to build a bridge between these two models. In this paper, we consider the maximum Borel flow problem formulated in a network where capacities on arcs are given as Borel measures and storage might be allowed at the nodes of the network. This problem is formulated as a linear program in a space of measures. We define a dual problem and prove a strong duality result. We show that strong duality is closely related to a MaxFlow-MinCut Theorem. KW - Maximum flow problem KW - Borel flow KW - Strong duality KW - Infinite dimensional linear programming KW - MaxFlow-MinCut Theorem Y1 - 2011 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/810 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-8103 ER -