A Metaheuristic Framework for Dynamic Network Flow Problems-Reference-Cited by-同舟云学术

A Metaheuristic Framework for Dynamic Network Flow Problems

Published:2017-09-19 Issue: Volume: Page:285-304
ISSN:1387-666X
Container-title:Operations Research/Computer Science Interfaces Series
language:
Short-container-title:

Author:

Hajjem M.,Bouziri H.,Talbi El-Ghazali

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5_16

Reference33 articles.

1. B. Awerbuch, T. Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in STOC ’94 Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

2. N. Baumann, Evacuation by earliest arrival flows. PhD thesis, University Dortmund, Dortmund, 2006

3. N. Baumann, E. Köhler, Approximating earliest arrival flows with flow-dependent transit times. Discr. Appl. Math. 155, 161–171 (2007)

4. N. Baumann, M. Skutella, Earliest arrival flows with multiple sources. Math. Oper. Res. 34, 499–512 (2009)

5. R. Burkard, K. Dlaska, B. Klinz, The quickest flow problem. ZOR Methods Models Oper Res. 37, 31–58 (1993)

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

1. Quantitative Analysis of Flow Distributions in a Multiuser Telecommunication Network;Известия Российской академии наук. Теория и системы управления;2023-03-01

2. Analysis of the Load Distribution and Internodal Flows under Different Routing Strategies in a Multiuser Network;Journal of Computer and Systems Sciences International;2022-12

3. Estimate of Resource Distribution with the Shortest Paths in the Multiuser Network;Journal of Computer and Systems Sciences International;2022-08