Estimation and determination of shortest path length in a road network with obstacles
type: Item
instance of: scholarly article
title: Estimation and determination of shortest path length in a road network with obstacles
zbMATH Open document ID: 0903.90060
DOI: 10.1016/0377-2217(94)00015-5
author: Nicolas Dubois
author: F. Semet
published in: European Journal of Operational Research
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1162957
zbMATH Keywords: transportation
zbMATH Keywords: regression
zbMATH Keywords: shortest path
zbMATH Keywords: lower bound
zbMATH Keywords: Dijkstra algorithm
zbMATH Keywords: Swiss road network
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00015-5
OpenAlex ID: W2127989417
cites work: Estimating road distances by mathematical functions
cites work: An improvement of Dijkstra's method for finding a shortest path in a graph
cites work: Q5749144
cites work: A note on two problems in connexion with graphs
cites work: Q3995519
cites work: The Development of Linear Distance Functions for Distribution Analysis
cites work: Mathematical Models of Road Travel Distances
Recommended article: Shortest path calculation in large road networks
Recommended article: Finding reliable shortest paths in road networks under uncertainty
Recommended article: Q3513087
Recommended article: Euclidean shortest path in the presence of obstacles
Recommended article: The shortest path problem on large-scale real-road networks
Recommended article: Shortest paths among transient obstacles
Recommended article: Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
Recommended article: Shortest path-planning in road nets with forbidden routes
Recommended article: Q3722287
description: scientific article; zbMATH DE number 1162957