Results 51 to 60 of about 1,116,280 (113)
The design of transportation networks: a multi objective model combining equity, efficiency and efficacy [PDF]
, 2012 A network design problem consists in locating facilities (nodes and arcs) that enable the transfer of flows (passengers and/or goods) from given origin-destination pairs.
Barbati, Maria
core +1 more source
PSPCM shortest path computation.
, 2022 PSPCM shortest path computation.
Innocent Uzougbo Onwuegbuzie (9243166) +4 more
core +1 more source
SIAM Journal on Computing, 1998 Summary: We give algorithms for finding the \(k\) shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with \(n\) vertices and \(m\) edges, in time \(O(m+n\log n+k)\). We can also find the \(k\) shortest paths from a given source \(s\) to each
openaire +2 more sources
Rapid Physarum Algorithm for shortest path problem
, 2014 As shortest path (SP) problem has been one of the most fundamental network optimization problems for a long time, technologies for this problem are still being studied.
Zhang, Xiaoge +5 more
core +1 more source
Extracting Multi-objective Multigraph Features for the Shortest Path Cost Prediction: Statistics-based or Learning-based? [PDF]
Efficient airport airside ground movement (AAGM) is key to successful operations of urban air mobility. Recent studies have introduced the use of multi-objective multigraphs (MOMGs) as the conceptual prototype to formulate AAGM.
Jun Chen +3 more
core +1 more source
Knapsack: Connectedness, Path, and Shortest-Path
Accepted in LATIN ...
Palash Dey, Sudeshna Kolay, Sipra Singh
openaire +3 more sources
Yet another bidirectional algorithm for shortest paths [PDF]
For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes.
Post, H., Pijls, W.H.L.M.
core
Shortest Paths in Reachability Graphs
Journal of Computer and System Sciences, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Desel, Javier Esparza
openaire +1 more source
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.
Post, H., Pijls, W.H.L.M.
core
Shortest paths in conservative graphs
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CONFORTI, MICHELANGELO, RIZZI R.
openaire +4 more sources