On continuous network flows

DOI10.1016/0167-6377(94)00035-5zbMath0835.90027OpenAlexW2060183110MaRDI QIDQ1892659

Raphael Rom, Ariel Orda

Publication date: 15 April 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)00035-5

zbMATH Keywords

time-dependencyuniversal flowscontinuous dynamic flowsmin-cut max- flow theorem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Efficient continuous-time dynamic network flow algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient flows in networks
• Dioïds and semirings: Links to fuzzy sets and other applications
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Optimal Congestion Control in Single Destination Networks
• A Class of Continuous Network Flow Problems
• Minimum weight paths in time-dependent networks
• The Modeling of Adaptive Routing in Data-Communication Networks
• Shortest route with time dependent length of edges and limited delay possibilities in nodes
• A generalized dynamic flows problem
• Constructing Maximal Dynamic Flows from Static Flows
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Continuous-Time Flows in Networks

This page was built for publication: On continuous network flows