Results 101 to 110 of about 550,853 (271)
The complexity of an inverse shortest paths problem [PDF]
, 1999 Sándor Fekete +3 more
openalex +1 more source
The Constrained Shortest Path Problem: A Case Study in Using ASMs [PDF]
, 1997 Karl Strötmann
openalex +1 more source
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
Bidirectional A*: comparing balanced and symmetric heuristic methods [PDF]
A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriatehitherto, uses so-called balanced heuristic estimates.
Pijls, W.H.L.M., Post, H.
core +1 more source
Wasserstein distributionally robust shortest path problem [PDF]
European Journal of Operational Research, 2019 Zhuolin Wang +3 more
semanticscholar +1 more source
Approximation algorithms for geometric shortest path problems [PDF]
, 2000 Lyudmil Aleksandrov +2 more
openalex +1 more source
A new O(m + kn log d) algorithm to Find the k shortest paths in acyclic digraphs [PDF]
Transactions on Combinatorics, 2016 We give an algorithm, called T*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.First the nodes of the graph are labeled according to the topologicalordering.
Mehdi Kadivar
doaj
Parallel Algorithms for Dynamic Shortest Path Problems [PDF]
, 2002 Ismaïl Chabini, Sridevi Ganugapati
openalex +1 more source
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets [PDF]
, 2002 T. B. Boffey +3 more
openalex +1 more source
Shortest Path Problems in Weighted Regions
La búsqueda de caminos mínimos es uno de los problemas más estudiados en el campo de la geometría computacional. En esta tesis nos hemos centrado en caminos mínimos en escenarios geométricos, un entorno que tiene muchas aplicaciones en robótica, computación gráfica y sistemas de información geográfica.
openaire +2 more sources