Results 31 to 40 of about 32,185 (303)
Variations on the Stochastic Shortest Path Problem [PDF]
, 2015 Invited paper for VMCAI ...
Randour, Mickaël +2 more
openaire +5 more sources
On the K shortest path trees problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-Noda +1 more
openaire +1 more source
The Capacity Expansion Path Problem in Networks
Journal of Applied Mathematics, 2013 This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj +1 more source
A machine learning approach for predicting human shortest path task performance
Visual Informatics, 2022 Finding a shortest path for a given pair of vertices in a graph drawing is one of the fundamental tasks for qualitative evaluation of graph drawings.
Shijun Cai +4 more
doaj +1 more source
Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path
, 2021 The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem.
Syahputra, Dinur +2 more
core +1 more source
Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph [PDF]
Neutrosophic Sets and Systems, 2019 One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but ...
Siddhartha Sankar Biswas
doaj +1 more source
Lasso formulation of the shortest path problem [PDF]
, 2020 The shortest path problem is formulated as an l1-regularized regression problem, known as lasso. Based on this formulation, a connection is established between Dijkstra's shortest path algorithm and the least angle regression (LARS) for the lasso problem.
Dong, Anqi +5 more
core +1 more source
Complexity of the Temporal Shortest Path Interdiction Problem [PDF]
, 2023 In the shortest path interdiction problem, an interdictor aims to remove arcs of total cost at most a given budget from a directed graph with given arc costs and traversal times such that the length of a shortest s-t-path is maximized. For static graphs,
Wittmann, Alina +2 more
core +1 more source
“rsppfp”: An R package for the shortest path problem with forbidden paths
SoftwareX, 2019 The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution.
Melina Vidoni, Aldo Vecchietti
doaj +1 more source
An Algorithm for the Cycled Shortest Path Problem [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2011 For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with
Asghar Aini, Amir Salehipour
doaj