Optimal Flow in Dynamic Networks with Nonlinear Cost Functions on Edges-Reference-Cited by-同舟云学术

Optimal Flow in Dynamic Networks with Nonlinear Cost Functions on Edges

Published:2003 Issue: Volume: Page:247-258
ISSN:1868-4238
Container-title:Analysis and Optimization of Differential Systems
language:
Short-container-title:

Author:

Lozovanu Dmitrii,Stratila Dan

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-35690-7_25

Reference10 articles.

1. L. R. Ford, Jr. and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Res., 6: 419–433, 1958.

2. L. R. Ford, Jr. and D. R. Fulkerson. Flows in networks. Princeton University Press, Princeton, N.J., 1962.

3. D. Lozovanu and D. Stratila. The minimum-cost flow problem on dynamic networks and an algorithm for its solving. Bul. Acad. Stiinte Repub. Mold. Mat., (3): 38–56, 2001.

4. Lisa Fleischer and Martin Skutella. The quickest multicommodity flow problem. In Integer Programming and Combinatorial Optimization, pages 36–53. Springer, Berlin, 2002.

5. Bettina Klinz and Gerhard J. Woeginger. Minimum cost dynamic flows: the series-parallel case. In Integer programming and combinatorial optimization (Copenhagen, 1995), pages 329–343. Springer, Berlin, 1995.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Markov Decision Processes and Stochastic Control Problems on Networks;International Series in Operations Research & Management Science;2024

2. Optimal Flows in Dynamic Networks and Algorithms for their Finding;Handbook of Optimization in Complex Networks;2011-09-29

3. Multiobjective Control of Time-Discrete Systems and Dynamic Games on Networks;Pareto Optimality, Game Theory And Equilibria;2008