Results 51 to 60 of about 550,853 (271)
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
A fast layered path planning algorithm for job shop scheduling problem
IET Collaborative Intelligent Manufacturing, 2022 Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj +1 more source
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
Cellular Automata Applications in Shortest Path Problem
, 2017 Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally.
A Macwan +55 more
core +1 more source
Finding $k$ Simple Shortest Paths and Cycles [PDF]
, 2016 The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair,
Agarwal, Udit, Ramachandran, Vijaya
core +2 more sources
MATEC Web of Conferences, 2016 Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj +1 more source
Shortest path problem under triangular fuzzy neutrosophic information
International Conference on Software, Knowledge, Information Management and Applications, 2016 In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number.
S. Broumi +4 more
semanticscholar +1 more source
On an instance of the inverse shortest paths problem [PDF]
Mathematical Programming, 1992 The inverse shortest paths problem in a graph is considered, that is, the problem of recovering the arc costs given some information about the shortest paths in the graph. The problem is first motivated by some practical examples arising from applications.
Burton, Didier, Toint, Philippe
openaire +2 more sources
Rerouting shortest paths in planar graphs [PDF]
, 2012 A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists ...
Bonsma, Paul
core +3 more sources
On the shortest $$\alpha$$-reliable path problem
TOP, 2021 In this variant of the constrained shortest path problem, the time of traversing an arc is given by a non-negative continuous random variable. The problem is to find a minimum cost path from an origin to a destination, ensuring that the probability of reaching the destination within a time limit meets a certain reliability threshold.
David Corredor-Montenegro +3 more
openaire +3 more sources