Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Maximum Multicommodity Flow with Intermediate Storage
Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala
Mathematical Problems in Engineering (2021) Vol. 2021, pp. 1-11
Open Access | Times Cited: 18

Showing 18 citing articles:

Generalized maximum flow over time with intermediate storage
Tanka Nath Dhamala, Mohan Chandra Adhikari, Durga Prasad Khanal, et al.
Annals of Operations Research (2024) Vol. 335, Iss. 1, pp. 111-134
Closed Access | Times Cited: 4
Network restructuring for dynamic flow improvement
Tanka Nath Dhamala, Durga Prasad Khanal, Stephan Dempe
Annals of Operations Research (2025)
Closed Access
Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
Durga Prasad Khanal, Shiva Prakash Gupta, Urmila Pyakurel, et al.
Journal of Industrial and Management Optimization (2025)
Open Access
Abstract network flow with intermediate storage for evacuation planning
Urmila Pyakurel, Durga Prasad Khanal, Tanka Nath Dhamala
European Journal of Operational Research (2022) Vol. 305, Iss. 3, pp. 1178-1193
Closed Access | Times Cited: 18
FlowLoc problems with maximum excess flow
Tanka Nath Dhamala, Sachin Wagle, Urmila Pyakurel
Journal of Industrial and Management Optimization (2023) Vol. 19, Iss. 12, pp. 8851-8870
Open Access | Times Cited: 6
Order-Guided Non-Conservative Maximum Flow in Uncertain Network Interdiction Problem with Budget Constraint
Badri Prasad Pangeni, Tanka Nath Dhamala
Journal of Uncertain Systems (2024) Vol. 17, Iss. 04
Closed Access | Times Cited: 1
Extreme Min – Cut Max – Flow Algorithm
Trust Tawanda, Philimon Nyamugure, Elias Munapo, et al.
International Journal of Applied Metaheuristic Computing (2023) Vol. 14, Iss. 1, pp. 1-16
Open Access | Times Cited: 2
Dynamic Contraflow with Orientation Dependent Transit Times Allowing Intermediate Storage
Durga Prasad Khanal, Urmila Pyakurel, Stephan Dempe
The Nepali Mathematical Sciences Report (2021) Vol. 38, Iss. 2, pp. 1-12
Open Access | Times Cited: 5
Efficient Algorithms for Abstract Flow with Partial Switching
Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala, et al.
Operations Research Forum (2022) Vol. 3, Iss. 4
Closed Access | Times Cited: 3
Maximum flow in hybrid network with intermediate storage
Badri Prasad Pangeni, Tanka Nath Dhamala
OPSEARCH (2024)
Closed Access
Prioritized Maximum Multi-Commodity Flow in Evacuation Planning
Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala, et al.
Springer optimization and its applications (2024), pp. 123-140
Closed Access
Maximum Dynamic FlowLoc with Intermediate Storage: A Temporally Repeated Approach
Sachin Wagle, Durga Prasad Khanal, Urmila Pyakurel, et al.
Operations Research Forum (2024) Vol. 6, Iss. 1
Closed Access
In Memoriam: Urmila Pyakurel (1980–2023)
Tanka Nath Dhamala, Anna Nagurney
Operations Research Forum (2023) Vol. 4, Iss. 4
Closed Access | Times Cited: 1
Abstract Temporally Repeated Flow with Intermediate Storage
Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala, et al.
The Nepali Mathematical Sciences Report (2022) Vol. 39, Iss. 2, pp. 67-78
Open Access | Times Cited: 2
Maximum Multi-Commodity Flow with Proportional and Flow-Dependent Capacity Sharing
Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala, et al.
(2021), pp. 5-5
Open Access | Times Cited: 2
Lexicographic Maximum Flow Allowing Intermediate Storage
Mohan Chandra Adhikari, Urmila Pyakurel
The Nepali Mathematical Sciences Report (2022) Vol. 39, Iss. 1, pp. 1-13
Open Access | Times Cited: 1
A Novel Maximum Flow Algorithm with Neural Network for Time-Varying Wastage Networks
Baowen Zhang, Kaiwen Jiang, Wei Huang
Security and Communication Networks (2022) Vol. 2022, pp. 1-9
Open Access | Times Cited: 1
Optimal Reconfiguration of Network with Variant Transmission Times on Arcs
Shiva Prakash Gupta, Urmila Pyakurel, Tanka Nath Dhamala
The Nepali Mathematical Sciences Report (2023) Vol. 40, Iss. 1-2, pp. 11-33
Open Access
Page 1

Scroll to top