Results 41 to 50 of about 550,853 (271)
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
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
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
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
Shortest Path Problem Under Interval Valued Neutrosophic Setting
, 2018 This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here each arc length is
S. Broumi +5 more
semanticscholar +1 more source
Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem
, 2018 Optimization is an effort to obtain the best results by considering the constraints, constraints, and limitations that exist on a problem; the goal is to minimize or suppress the things that harm and maximize the things that are considered profitable ...
A. Siahaan, M. Mesran
semanticscholar +1 more source
Shortest-path problems and molecular conformation
Discrete Applied Mathematics, 1988 AbstractGiven a set of experimentally determined lower and upper bounds on the distances between the atoms of a molecule, we study the minimum and maximum values that any one distance can attain when all of the remaining distances are confined between their lower and upper bounds.
Dress, Andreas, Havel, Timothy F.
openaire +3 more sources
IEEE AccessPathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions ...
Amr Elshahed +4 more
doaj +1 more source
The disjoint shortest paths problem
Discrete Applied Mathematics, 1998 AbstractThe disjoint shortest paths problem is defined as follows. Given a graph G and k pairs of distinct vertices (si, ti), 1 ⩽ i ⩽ k, find whether there exist k pairwise disjoint shortest paths Pi, between si and ti for all 1 ⩽i ⩽ k. We may consider directed or undirected graphs and the paths may be vertex or edge disjoint.
openaire +2 more sources
Computing a rectilinear shortest path amid splinegons in plane
, 2017 We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin +16 more
core +1 more source