Results 81 to 90 of about 1,116,280 (113)
Some of the next articles are maybe not open access.
Mathematical Methods of Operations Research (ZOR), 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vito Fragnelli +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vito Fragnelli +2 more
openaire +2 more sources
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
Shortest path problem with uncertain arc lengths [PDF]
Computers and Mathematics With Applications, 2011 Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it
Yuan Gao
exaly +2 more sources
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 +3 more sources
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
Shortest paths with side sensors
2011 IEEE International Conference on Robotics and Automation, 2011We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field-Of-View (FOV). In this paper we provide a generalization to
SALARIS, PAOLO +2 more
openaire +1 more source
On shortest paths in polyhedral spaces
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984We consider the problem of computing the shortest path between two points in two- or three-dimensional space bounded by polyhedral surfaces. In the two-dimensional case the problem is easily solved in time \(O(n^ 2\log n)\). In the general three-dimensional case the problem is quite hard to solve, and is not even discrete; we present a doubly ...
Micha Sharir, Amir Schorr
openaire +3 more sources
The shortest path problem with forbidden paths
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Villeneuve, Guy Desaulniers
openaire +4 more sources
The weight of the shortest path tree
Random Structures & Algorithms, 2006AbstractThe minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1. © 2006 Wiley Periodicals, Inc. Random Struct.
Remco van der Hofstad +2 more
openaire +3 more sources