Results 1 to 10 of about 218,626 (238)
Some of the next articles are maybe not open access.
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
Finding Top-k Shortest Paths with Diversity
IEEE Transactions on Knowledge and Data Engineering, 2018Huiping Liu, Cheqing Jin, Bin Yang
exaly
Improved algorithms for the k simple shortest paths and the replacement paths problems
Information Processing Letters, 2009Zvi Gotthilf, Moshe Lewenstein
exaly
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM, 1999Mikkel Thorup
exaly
Finding the k reliable shortest paths under travel time uncertainty
Transportation Research Part B: Methodological, 2016Bi Yu Chen +2 more
exaly
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research, 2012Wangtu Xu, Shiwei He, Rui Song
exaly

