Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times
Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time to traverse an arc. Moreover, all the paramete...
Saved in:
Main Authors: | Gholamhasan Shirdel, Hasan Rezapour |
---|---|
Format: | Article |
Language: | fas |
Published: |
University of Qom
2020-09-01
|
Series: | مدیریت مهندسی و رایانش نرم |
Subjects: | |
Online Access: | https://jemsc.qom.ac.ir/article_1068_c81e51869e8e5eb621be93c818e5df13.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Influence of shortest path algorithms on energy consumption of multi-core processors
by: A. A. Prihozhy, et al.
Published: (2023-10-01) -
Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms
by: A. A. Prihozhy
Published: (2021-10-01) -
Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
by: O. N. Karasik, et al.
Published: (2022-12-01) -
Dynamic Response and Lubrication Performance of Spur Gear Pair Under Time-Varying Rotation Speeds
by: Jiaxing Pei, et al.
Published: (2025-01-01) -
DOA estimation method for time-varying metasurface based on asynchronous modulation
by: YI Ming, et al.
Published: (2025-01-01)