Results 201 to 210 of about 218,626 (238)
Some of the next articles are maybe not open access.
The shortest path problem with forbidden paths
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guy Desaulniers
exaly +4 more sources
Shortest paths on a polyhedron
Proceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990We present an algorithm for determining the shortest path between a source point and any destination point along the surface of a polyhedron (need not be convex). Our algorithm uses a new approach which deviates from the conventional “continuous Dijkstra” technique.
Jindong Chen, Yijie Han
openaire +1 more source
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
Mathematical Methods of Operations Research (ZOR), 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vito Fragnelli +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vito Fragnelli +2 more
openaire +1 more source
On Shortest Path Representation
IEEE/ACM Transactions on Networking, 2007Lately, it has been proposed to use shortest path first routing to implement Traffic Engineering in IP networks. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. Clearly, only certain shortest path representable path sets can be used in this setting, that is, paths ...
Gábor Rétvári +2 more
openaire +2 more sources
Near-shortest and K-shortest simple paths
Networks, 2005Summary: We present a new algorithm for enumerating all near-shortest simple (loopless) \(s\)-\(t\) paths in a graph \(G=(V,E)\) with nonnegative edge lengths. Letting \(n=|V|\) and \(m=|E|\), the time per path enumerated is \(O(nS(n,m))\) given a user-selected short-est-path subroutine with complexity \(O(S(n,m))\).
W. Matthew Carlyle, R. Kevin Wood
openaire +2 more sources
Shortest‐path network interdiction
Networks, 2002AbstractWe study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget.
Eitan Israeli, R. Kevin Wood
openaire +3 more sources
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 ...
Robert Sedgewick, Jeffrey Scott Vitter
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