Continuous-Time Flows in Networks

DOI10.1287/moor.15.4.640zbMath0719.90030OpenAlexW2154745223MaRDI QIDQ5752273

Andy B. Philpott

Publication date: 1990

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.15.4.640

zbMATH Keywords

maximum flowdirected networktraversal timearc flows vary as Lebesgue-measurable functions of time

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (19)

On continuous network flows ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Dynamic flows with time-dependent capacities ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Continuous and discrete flows over time ⋮ An Introduction to Network Flows over Time ⋮ On solving continuous-time dynamic network flows ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On solving maximum and quickest interval-valued flows over time ⋮ Distributed shortest-path protocols for time-dependent networks ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Perspectives on integer programming for time-dependent models ⋮ Universally maximum flow with piecewise-constant capacities ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Efficient continuous-time dynamic network flow algorithms ⋮ Algorithms for flows over time with scheduling costs

This page was built for publication: Continuous-Time Flows in Networks