A Class of Continuous Network Flow Problems
From MaRDI portal
Cited in
(21)- On continuous network flows
- A measure-theoretical max-flow-min-cut problem
- Perspectives on integer programming for time-dependent models
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Continuous time dynamic contraflow models and algorithms
- Distributed shortest-path protocols for time-dependent networks
- Examples of max-flow and min-cut problems with duality gaps in continuous networks
- 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
- A critical survey on the network optimization algorithms for evacuation planning problems
- Optimal control on a graph with application to train scheduling 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 continuous-time dynamic network flows
- On solving maximum and quickest interval-valued flows over time
- A survey of dynamic network flows
- A survey on models and algorithms for discrete evacuation planning network problems
- An introduction to network flows over time
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
This page was built for publication: A Class of Continuous Network Flow Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964298)
