Multi-commodity flow problem on lossy network with partial lane reversals-Reference-Cited by-同舟云学术

Multi-commodity flow problem on lossy network with partial lane reversals

Published:2023-02-06 Issue:1-2 Volume:323 Page:45-63
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Gupta Shiva Prakash^ORCID,Pyakurel Urmila^ORCID,Dhamala Tanka Nath^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://link.springer.com/content/pdf/10.1007/s10479-023-05210-y.pdf

Reference33 articles.

1. Ahuja, R. K., Orlin, J. B., & Magnanti, T. L. (1993). Network flows: Theory, algorithms, and applications. Hoboken, New Jersey: Prentice-Hall.

2. Ali, A., Helgason, R., Kennington, J., & Lall, H. (1980). Computational comparison among three multi-commodity network flow algorithms. Operations Research, 28(4), 995–1000.

3. Assad, A. A. (1978). Multi-commodity network flows a survey. Networks, 8(1), 37–91.

4. Dhamala, T. N., Pyakurel, U., & Dempe, S. (2018). A critical survey on the network optimization algorithms for evacuation planning problems. International Journal of Operations Research, 15(3), 101–133.

5. Dhamala, T. N., Gupta, S. P., Khanal, D. P., & Pyakurel, U. (2020). Quickest multi-commodity flow over time with partial lane reversals. Journal of Mathematics and Statistics, 16(1), 198–211.

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

1. Generalized maximum flow over time with intermediate storage;Annals of Operations Research;2024-01-04

2. In Memoriam: Urmila Pyakurel (1980–2023);Operations Research Forum;2023-11-29

3. Extreme Min – Cut Max – Flow Algorithm;International Journal of Applied Metaheuristic Computing;2023-05-05