Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
From MaRDI portal
Publication:5039041
Cites work
- A new algorithm for shortest paths among obstacles in the plane
- An exact method for finding shortest routes on a sphere, avoiding obstacles
- Bi-objective location model of two rectangular facilities
- Continuous location model of a rectangular barrier facility
- Euclidean shortest paths in the presence of rectilinear barriers
- Finding minimum rectilinear distance paths in the presence of barriers
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- Rectilinear distance to a facility in the presence of a square barrier
- Rectilinear shortest paths in the presence of rectangular barriers
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Time-dependent traffic flow in a rectangular city with rectilinear distance
- \(L_ 1\) shortest paths among polygonal 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039041)