ON CONTINUOUS NETWORK FLOWS

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