Results 41 to 50 of about 569,188 (376)
The Shortest Path Problem for a Multiple Graph
Моделирование и анализ информационных систем, 2017 In the article, the definition of an undirected multiple graph of any natural multiplicity k > 1 is stated. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is the union of k linked edges,
Alexander V. Smirnov
doaj +1 more source
Two-degree-of-freedom manipulator path planning based on zeroing neural network [PDF]
MATEC Web of Conferences, 2020 In this paper, the shortest path problem of manipulator path planning is transformed into a linear programming problem, and solved by zeroing neural network (ZNN).
Li Yan, Liu Keping
doaj +1 more source
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times [PDF]
مدیریت مهندسی و رایانش نرم, 2020 Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time ...
Gholamhasan Shirdel, Hasan Rezapour
doaj +1 more source
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
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
Shortest Path Problems on a Polyhedral Surface [PDF]
Algorithmica, 2009 We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface are measured either by the length of a Euclidean shortest path or by link distance. Our main result is a linear-factor speedup for computing all shortest path edge sequences on
Wenk, Carola, Cook, Atlas F.
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
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
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