Results 131 to 140 of about 218,121 (185)
A method for planning cycling networks in traditional village contiguous areas using Wi-Fi probe-based attractiveness evaluation. [PDF]
Sci RepLiu S, Wang S, Gao Y, Zhou Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
International Journal of Computational Geometry & Applications, 1996We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the ...
Chen, Jindong, Han, Yijie
openaire +1 more source
2008
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire +2 more sources
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire +2 more sources
Dynamic shortest‐path interdiction
Networks, 2016We study a dynamic network game between an attacker and a user. The user wishes to find a shortest path between a pair of nodes in a directed network, and the attacker seeks to interdict a subset of arcs to maximize the user's shortest‐path cost. In contrast to most previous studies, the attacker can interdict arcs any time the user reaches a node in ...
Sefair, Jorge A., Smith, J. Cole
openaire +1 more source
Shortest Paths with Shortest Detours
Journal of Optimization Theory and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani +3 more
openaire +1 more source
Shortest paths in euclidean graphs
Algorithmica, 1986We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are Euclidean distances between points). For many graph models, the average running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is ...
Sedgewick, Robert, Vitter, Jeffrey Scott
openaire +1 more source