On continuous network flows

This work addresses two problems concerning continuous dynamic flows. A model is presented for a network that incorporates continuous time-varying flows, link capacities, node storage capacities, as well as time dependent link delays. It is an enhancement of previous results which do not incorporate time varying link delays. The authors present a generalized min-cut max-flow theorem for that model. A second result deals with universal flows, originally dealt with for the discrete case. The authors show how such flows can be constructed in a way that involves parallelism.