Results 11 to 20 of about 302,682 (305)
A genetic algorithm for the fuzzy shortest path problem in a fuzzy network
Complex & Intelligent Systems, 2020 The shortest path problem (SPP) is an optimization problem of determining a path between specified source vertex s and destination vertex t in a fuzzy network.
Lihua Lin, Chu-Tao Wu, Li Ma
semanticscholar +1 more source
Neutrosophic Shortest Path Problem
Neutrosophic Sets and Systems, 2018 Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP).
Ranjan Kumar +4 more
openaire +3 more sources
On Dynamic Shortest Paths Problems [PDF]
Algorithmica, 2004 We obtain the following results related to dynamic versions of the shortest-paths problem: Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths problem.
Uri Zwick, Liam Roditty
openaire +3 more sources
A spectral approach to the shortest path problem [PDF]
Linear Algebra and its Applications, 2021 Let $G=(V,E)$ be a simple, connected graph. One is often interested in a short path between two vertices $u,v$. We propose a spectral algorithm: construct the function $ϕ:V \rightarrow \mathbb{R}_{\geq 0}$ $$ ϕ= \arg\min_{f:V \rightarrow \mathbb{R} \atop f(u) = 0, f \not\equiv 0} \frac{\sum_{(w_1, w_2) \in E}{(f(w_1)-f(w_2))^2}}{\sum_{w \in V}{f(w)^2}}.
openaire +2 more sources
Shortest path problem using Bellman algorithm under neutrosophic environment
Complex & Intelligent Systems, 2019 An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem.
S. Broumi +7 more
semanticscholar +1 more source
On an instance of the inverse shortest paths problem [PDF]
Mathematical Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burton, Didier, Toint, Philippe
openaire +3 more sources
Lasso formulation of the shortest path problem [PDF]
2020 59th IEEE Conference on Decision and Control (CDC), 2020 The shortest path problem is formulated as an $l_1$-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 +2 more
openaire +4 more sources
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
Complex & Intelligent Systems, 2019 Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set.
S. Broumi +5 more
semanticscholar +1 more source
Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
Complex & Intelligent Systems, 2019 In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms.
S. Broumi +6 more
semanticscholar +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