Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding rectilinear least cost paths in the presence of convex polygonal congested regions |
scientific article; zbMATH DE number 5369395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding rectilinear least cost paths in the presence of convex polygonal congested regions |
scientific article; zbMATH DE number 5369395 |
Statements
Finding rectilinear least cost paths in the presence of convex polygonal congested regions (English)
0 references
20 November 2008
0 references
least cost path
0 references
congested regions
0 references
rectilinear distance metric
0 references
0 references
0 references
