Transient flows in networks
From MaRDI portal
Cited in
(36)- On continuous network flows
- Existence and Uniqueness of Equilibria for Flows over Time
- Algorithms for flows over time with scheduling costs
- Multicommodity flows over time: Efficient algorithms and complexity
- A Stackelberg strategy for routing flow over time
- Maximum contraflow evacuation planning problems on multi-network
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Dynamic resource allocation problem for transportation network evacuation
- Engpässe, Staustellen und glatte homogene Ströme in Netzen
- Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
- Maximum-throughput dynamic network flows
- Minsum \(k\)-sink problem on path networks
- Efficient continuous-time dynamic network flow algorithms
- Equilibria in routing games with edge priorities
- Continuous dynamic contraflow approach for evacuation planning
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Dynamic Atomic Congestion Games with Seasonal Flows
- Pattern-based evacuation planning for urban areas
- Long-term behavior of dynamic equilibria in fluid queuing networks
- A critical survey on the network optimization algorithms for evacuation planning problems
- Bicriteria Nash flows over time
- Algorithms for Flows over Time with Scheduling Costs
- Time-varying universal maximum flow problems
- Earliest arrival flows on series-parallel graphs
- Dynamic equilibria in fluid queueing networks
- A survey of dynamic network flows
- Earliest arrival flows in networks with multiple sinks
- Lexicographically optimal earliest arrival flows
- Approximating earliest arrival flows with flow-dependent transit times
- A survey on models and algorithms for discrete evacuation planning network problems
- An introduction to network flows over time
- Analysis and design of communication networks with memory
- Network flow with intermediate storage: models and algorithms
- On the price of anarchy for flows over time
- Traffic Networks and Flows over Time
- Earliest arrival flows in networks with multiple sinks
This page was built for publication: Transient flows in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1131603)
