Continuous-Time Flows in Networks
From MaRDI portal
Publication:5752273
DOI10.1287/MOOR.15.4.640zbMATH Open0719.90030OpenAlexW2154745223MaRDI QIDQ5752273FDOQ5752273
Authors: A. 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
Recommendations
- On continuous network flows
- Dynamic flows in networks
- scientific article; zbMATH DE number 3174052
- Dynamic flows in time-varying networks.
- On solving continuous-time dynamic network flows
- An introduction to network flows over time
- scientific article; zbMATH DE number 1537495
- Efficient continuous-time dynamic network flow algorithms
- Asymptotic behavior of flows in networks
- scientific article; zbMATH DE number 3860851
Cited In (31)
- Continuity and monotonicity of solutions to a greedy maximization problem
- On continuous network flows
- Static flows in networks
- Extreme Points for Continuous Network Programs with Arc Delays
- Explicit formulae for limit periodic flows on networks
- Perspectives on integer programming for time-dependent models
- Algorithms for flows over time with scheduling costs
- Title not available (Why is that?)
- Distributed shortest-path protocols for time-dependent networks
- Dynamic flows with time-dependent capacities
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Flows over time in time-varying networks: optimality conditions and strong duality
- Efficient continuous-time dynamic network flow algorithms
- Continuous dynamic contraflow approach for evacuation planning
- Dynamic Atomic Congestion Games with Seasonal Flows
- A critical survey on the network optimization algorithms for evacuation planning problems
- Continuous and discrete flows over time
- Dynamic network contraflow evacuation planning problem with continuous time approach
- Universally maximum flow with piecewise-constant capacities
- On solving maximum and quickest interval-valued flows over time
- On solving continuous-time dynamic network flows
- Short‐time existence for the network flow
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota
- Flows on graphs with varying transit times through the arcs
- Earliest arrival flows in networks with multiple sinks
- Title not available (Why is that?)
- An introduction to network flows over time
- Minimum‐cost flow problems having arc‐activation costs
- Title not available (Why is that?)
- Heterogeneous multi-commodity network flows over time
- Analysis of potential flow networks: variations in transport time with \textit{discrete}, \textit{continuous}, and \textit{selfish} operation
This page was built for publication: Continuous-Time Flows in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752273)
