Minimum parametric flow in time-dependent dynamic networks
From MaRDI portal
Distance in graphs (05C12) Paths and cycles (05C38) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Minimax problems in mathematical programming (90C47)
Recommendations
- The maximum parametric flow in discrete-time dynamic networks
- Maximum flows in parametric dynamic networks with lower bounds
- Parametric flows in static networks
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- A parametric approach to the Bi-Criteria minimum cost dynamic flow problem
Cites work
- A survey of dynamic network flows
- Algorithms for flows with parametric capacities
- An introduction to network flows over time
- scientific article; zbMATH DE number 42283 (Why is no real title available?)
- scientific article; zbMATH DE number 6304483 (Why is no real title available?)
- Max flows in O(nm) time, or better
- Maximum flows in parametric dynamic networks with lower bounds
- Minimum cost time-varying network flow problems
- Network flows. Theory, algorithms, and applications.
- On solving quickest time problems in time-dependent, dynamic networks
- The maximum parametric flow in discrete-time dynamic networks
- Time-varying network optimization.
Cited in
(4)
This page was built for publication: Minimum parametric flow in time-dependent dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553832)
