Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
From MaRDI portal
Publication:5039041
DOI10.55653/forma.2022.001.005zbMath1498.90050OpenAlexW4285411432MaRDI QIDQ5039041
Publication date: 12 October 2022
Published in: FORMA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.55653/forma.2022.001.005
Cites Work
- Unnamed Item
- Unnamed Item
- Continuous location model of a rectangular barrier facility
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- Rectilinear shortest paths in the presence of rectangular barriers
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- A new algorithm for shortest paths among obstacles in the plane
- Rectilinear distance to a facility in the presence of a square barrier
- Euclidean shortest paths in the presence of rectilinear barriers
- Finding minimum rectilinear distance paths in the presence of barriers
- An exact method for finding shortest routes on a sphere, avoiding obstacles
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
This page was built for publication: Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier