Results 241 to 250 of about 383,776 (277)
Some of the next articles are maybe not open access.
1986
Recently there has been considerable research activity on algorithms for finding shortest paths in geometries induced by obstacles. A typical problem is finding the shortest path between two points on the Euclidean plane avoiding a given set of polygonal obstacles (see Figure 1). We review this area and isolate several interesting open problems.
openaire +1 more source
Recently there has been considerable research activity on algorithms for finding shortest paths in geometries induced by obstacles. A typical problem is finding the shortest path between two points on the Euclidean plane avoiding a given set of polygonal obstacles (see Figure 1). We review this area and isolate several interesting open problems.
openaire +1 more source
Shortest path problem with uncertain arc lengths
Computers and Mathematics With Applications, 2011Yuan Gao
exaly
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
Applied Soft Computing Journal, 2012Yong Deng, Sankaran Mahadevan
exaly
A comparison of solution strategies for biobjective shortest path problems
Computers and Operations Research, 2009Andrea Raith, Matthias Ehrgott
exaly