On continuous network flows

Authors:
Ariel Orda;Raphael Rom
Affiliations:
Department of Electrical Engineering, and the S. Neaman Institute, Technion-Israel Institute of Technology, Haifa, Israel 32000;Department of Electrical Engineering, and the S. Neaman Institute, Technion-Israel Institute of Technology, Haifa, Israel 32000
Venue:
Operations Research Letters
Year:
1995

Citing 4
Cited 1

Graphs and algorithms

Graphs and algorithms
Continuous-time flows in networks

Mathematics of Operations Research
On the Solutions of a Class of Continuous Linear Programs

SIAM Journal on Control and Optimization
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)

Efficient continuous-time dynamic network flow algorithms

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. We 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. We show how such flows can be constructed in a way that involves parallelism.