Results 111 to 120 of about 3,733 (151)

Bellman-Ford and Floyd Warshall Algorithms for Easier Learning

, 2019
In this paper, Bellman-Ford and FloyWarshall Algorithms will be considered. Floyd-Warshall is used when we want to find the shortest path between all the pairs of nodes in graph. The Bellman-Ford algorithm is similar to Dijkstra algorithm, but it is used when the graph may also contain links with negative weights. The algorithms are implemented in Java
Stojkovic, Natasa, Kocaleva, Mirjana, Zlatanovska, Biljana, Stojanova, Aleksandra   +3 more
openaire   +1 more source

The Floyd-Warshall Algorithm, the AP and the TSP III

, 2002
We clarify the exposition of Phases 2 and 3a in "The Floyd-Warshall Algorithm, the AP and the TSP". We also improve and simplify theorem 3.6 . In line with clarifying the exposition, we change the matrices in examples 3.4 and 3.5 of "The Floyd-Warshall Algorithm, the AP and the TSP II".
openaire   +2 more sources

The Floyd-Warshall Algorithm Re-implemented Using 3D-Tensors and Hardware Acceleration

, 2023
The Floyd-Warshall(FW) algorithm, is an ancient but a largely important algorithm used to solve the all-pairs simple-paths(APSP) problem. While the algorithm is available for use in open-source graph optimization libraries such as NetworkX, they do not take advantage of modern parallel processing hardware such as Graphics Processing Units(GPUs), which ...
openaire   +2 more sources

An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. [PDF]

In this paper, we study the resource-constrained project scheduling problem (RCPSP) with discounted cash flows and generalized precedence relations (further denoted as RCPSPDC-GPR).
De Reyck, B, Herroelen, Willy
core  

The Floyd-Warshall Algorithm, the AP and the TSP, Part II

, 2001
Text in Word 2000, math in Math Type 4.0, sent in a PDF file written in Acrobat 5.0, 63 ...
openaire   +2 more sources

Tourism Route Optimization of Scenic Areas Based on Floyd Path Algorithm: Taking Tianjin Changlu Salt Field as an Example

Land
Sustainable tourist route design is a critical challenge in industrial heritage planning. While prior tourism routing algorithms predominantly minimize physical distance, and conventional heritage planning focuses on the static preservation of abandoned ...
Zikun Lin, Linlin Shan, Yang Liu, Long Zhang, Bin Yao   +4 more
doaj   +1 more source

Original optimal method to solve the all-pairs shortest path problem: Dhouib-matrix-ALL-SPP

Data Science and Management
The All-pairs shortest path problem (ALL-SPP) aims to find the shortest path joining all the vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL-SPP (DM-ALL-SPP) to solve the ALL-SPP based on column-row navigation ...
Souhail Dhouib
doaj   +1 more source

Modified Floyd Warshall Algorithm for Cache Management in Information Centric Network

International Journal of Intelligent Engineering and Systems, 2020
Boddepalli Kumar, Edara Reddy
openaire   +1 more source

Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm

International Journal of Computer Applications, 2019
openaire   +1 more source

Measuring shoot length of submerged aquatic plants using graph analysis [PDF]

Hovens, H.L.E., Polder, G., Zweers, A.J.
core   +2 more sources