Results 21 to 30 of about 23,111 (264)
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
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
Atlas F. Cook IV, Carola Wenk
openaire +5 more sources
A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems [PDF]
Neutrosophic Sets and Systems, 2019 Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely ...
Ranjan Kumar +5 more
doaj +1 more source
Variations on the Stochastic Shortest Path Problem [PDF]
, 2015 Invited paper for VMCAI ...
Randour, Mickael +2 more
openaire +5 more sources
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
On the minimum eccentricity shortest path problem
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feodor F. Dragan, Arne Leitert
openaire +2 more sources
A machine learning approach for predicting human shortest path task performance
Visual Informatics, 2022 Finding a shortest path for a given pair of vertices in a graph drawing is one of the fundamental tasks for qualitative evaluation of graph drawings.
Shijun Cai +4 more
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
Systematic Literature Review on Adjustable Robust Shortest Path Problem
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 In real-world optimization problems, effective path planning is important. The Shortest Path Problem (SPP) model is a classical operations research that can be applied to determine an efficient path from the starting point to the end point in a plan ...
Wida Nurul Fauziyah +2 more
doaj +1 more source