Results 31 to 40 of about 280,639 (334)
Variations on the Stochastic Shortest Path Problem [PDF]
, 2015 Invited paper for VMCAI ...
Randour, Mickael +2 more
openaire +4 more sources
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
ON ASSOCIATIVE SHORTEST PATH PROBLEMS [PDF]
Bulletin of informatics and cybernetics, 1997 Summary: We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicative-additive, minimum and fractional shortest path problems.
openaire +2 more sources
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
The Shortest Path Problem for the Distant Graph of the Projective Line Over the Ring of Integers [PDF]
, 2015 The distant graph $G = G(\mathbb{P}(Z),\triangle)$ of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein's geometric interpretation of Euclidean continued fractions.
Matraś, Andrzej, Siemaszko, Artur
core +2 more sources
Faster Replacement Paths [PDF]
, 2010 The replacement paths problem for directed graphs is to find for given nodes s and t and every edge e on the shortest path between them, the shortest path between s and t which avoids e.
Williams, Virginia Vassilevska
core +2 more sources
“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
Generalized Shortest Path Kernel on Graphs
, 2015 We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes.
A Fronczak +6 more
core +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
International Journal of Analysis and Applications, 2023 The Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks.
K. Vidhya, A. Saraswathi
doaj +1 more source