An introduction to dynamic generative networks: Minimum cost flow

作者：Hosseini Seyed Ahmad^*

来源：Applied Mathematical Modelling, 2011, 35(10): 5017-5025.

DOI：10.1016/j.apm.2011.04.009

• Optimization
• Network/graphs
• Linear programming
• Decomposition methods

What we are dealing with is a class of networks called dynamic generative network flows in which the flow commodity is dynamically generated at source nodes and dynamically consumed at sink nodes. As a basic assumption, the source nodes produce the flow according to time generative functions and the sink nodes absorb the flow according to time consumption functions. This paper tries to introduce these networks and formulate minimum cost dynamic flow problem for a pre-specified time horizon T. Finally, some simple, efficient approaches are developed to solve the dynamic problem, in the general form when the capacities and costs are time varying and some other special cases, as a minimum cost static flow problem.

• 出版日期2011-10