Transient flows in networks

DOI10.1307/mmj/1028998140zbMath0113.14203OpenAlexW2156849732MaRDI QIDQ1131603

David Gale

Publication date: 1959

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1307/mmj/1028998140

zbMATH Keywords

applications of probability theory and statistics

Related Items (35)

Earliest Arrival Flows in Networks with Multiple Sinks ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Dynamic resource allocation problem for transportation network evacuation ⋮ Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ On continuous network flows ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Dynamic Equilibria in Fluid Queueing Networks ⋮ Approximating earliest arrival flows with flow-dependent transit times ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ On the Price of Anarchy for Flows over Time ⋮ Lexicographically optimal earliest arrival flows ⋮ Equilibria in routing games with edge priorities ⋮ Pattern-based evacuation planning for urban areas ⋮ Unnamed Item ⋮ An Introduction to Network Flows over Time ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ Network flow with intermediate storage: models and algorithms ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Existence and Uniqueness of Equilibria for Flows over Time ⋮ Time-varying universal maximum flow problems ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Minsum \(k\)-sink problem on path networks ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ A Stackelberg strategy for routing flow over time ⋮ Earliest arrival flows on series-parallel graphs ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Traffic Networks and Flows over Time ⋮ Analysis and design of communication networks with memory ⋮ Maximum-throughput dynamic network flows ⋮ Efficient continuous-time dynamic network flow algorithms ⋮ Algorithms for flows over time with scheduling costs ⋮ Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

This page was built for publication: Transient flows in networks