Dynamic multicommodity contraflow problem with asymmetric transit times
From MaRDI portal
Publication:2138334
DOI10.1155/2022/3697141zbMath1499.90043OpenAlexW4225756444MaRDI QIDQ2138334
Tanka Nath Dhamala, Shiva Prakash Gupta, Urmila Pyakurel
Publication date: 11 May 2022
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2022/3697141
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity analysis for maximum flow problems with arc reversals
- Network flow with intermediate storage: models and algorithms
- Multicommodity flows over time: Efficient algorithms and complexity
- Optimal Dynamic Multicommodity Flows in Networks
- A Survey of Linear Cost Multicommodity Network Flows
- Multicommodity network flows—A survey
- Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem
- A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks
- Quickest Flows Over Time
This page was built for publication: Dynamic multicommodity contraflow problem with asymmetric transit times