An introduction to dynamic generative networks: minimum cost flow

DOI10.1016/J.APM.2011.04.009MaRDI QIDQ651703zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 18 December 2011

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2011.04.009

zbMATH Keywords

optimizationlinear programmingdecomposition methodsnetwork/graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48)

Recommendations

• Minimum cost flow problem on dynamic multi generative network flows
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• scientific article; zbMATH DE number 1918689
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• Determining minimum cost flows in dynamic networks with transit time functions that depend on flow and time

Cites work

• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• A multicommodity network-flow problem with side constraints on paths solved by column generation
• A survey of dynamic network flows
• Constructing maximal dynamic flows from static flows
• Decomposition Principle for Linear Programs
• Efficient continuous-time dynamic network flow algorithms
• Faster algorithms for the quickest transshipment problem
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• Network flows. Theory, algorithms, and applications.
• Optimal flows in dynamic networks and algorithms for their finding
• The Decomposition Algorithm for Linear Programs
• The quickest transshipment problem
• Universally maximum flow with piecewise-constant capacities

Cited in

(6)

• Minimum cost flow problem on dynamic multi generative network flows
• Determining the optimal flows in zero-time dynamic networks
• 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
• A model-based approach and analysis for multi-period networks
• Maximum flow problem on dynamic generative network flows with time-varying bounds

This page was built for publication: An introduction to dynamic generative networks: minimum cost flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651703)