Determining the optimal flows in zero-time dynamic networks
From MaRDI portal
Publication:1951168
DOI10.1007/s10852-011-9169-xzbMath1263.90014OpenAlexW1985627858MaRDI QIDQ1951168
Publication date: 29 May 2013
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-011-9169-x
Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Signed and weighted graphs (05C22)
Related Items
Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm, A decomposition-based approach for the multiperiod multiproduct distribution planning problem
Cites Work
- An introduction to dynamic generative networks: minimum cost flow
- A survey of dynamic network flows
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item