Balanced-flow algorithm for path network planning in hierarchical spaces

DOI10.1016/j.tcs.2019.10.028zbMath1442.90027OpenAlexW2981015484WikidataQ126998820 ScholiaQ126998820MaRDI QIDQ2283024

Yi Hong, Jiandong Liu, Chuanwen Luo, Deying Li, Mengjie Chang

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.10.028

zbMATH Keywords

path planningbatch schedulingbalanced-flow path networkhierarchical space

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Dynamic shortest path problems: hybrid routing policies considering network disruptions
• Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
• Modeling of building evacuation problems by network flows with side constraints
• A polynomial time primal network simplex algorithm for minimum cost flows
• Shortest paths algorithms: Theory and experimental evaluation
• An efficient approach to 3D path planning
• Min-max-flow based algorithm for evacuation network planning in restricted spaces
• Minimum cost noncrossing flow problem on layered networks
• Priority-oriented route network planning for evacuation in constrained space scenarios
• A survey on models and algorithms for discrete evacuation planning network problems
• Finding minimum-cost circulations by canceling negative cycles
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Finding the k Shortest Paths
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

This page was built for publication: Balanced-flow algorithm for path network planning in hierarchical spaces