Results 91 to 100 of about 550,853 (271)
A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT [PDF]
ICTACT Journal on Soft Computing, 2010 This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node.
A. Nagoorgani, A. Mumtaj Begam
doaj
Lazy Shortest Path Computation In Dynamic Graphs
Computer Science, 2012 We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates.
Daniel Aioanei
doaj +1 more source
The time-varying shortest path problem with fuzzy transit costs and speedup
Acta Universitatis Sapientiae: Mathematica, 2016 In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost.
Rezapour Hassan, Shirdel Gholamhassan
doaj +1 more source
L. A. Lyusternik, Shortest Paths–Variational Problems (Popular Lectures in Mathematics, Pergamon Press, Oxford, 1964), x+102 pp., 17s. 6d. [PDF]
, 1966 R. P. Gillespie
openalex +1 more source
The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows
, 2014 In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function .
N. El-Sherbeny
semanticscholar +1 more source
Constrained shortest paths and related problems
, 2001 The classical shortest path problem, to find a path of minimal cost between two nodes in a graph, is efficiently solvable in polynomial time. However, in many applications we also have additional budget or resource constraints on a path. This problem is known as constrained shortest path problem and unfortunately belongs to the class of "hard" problems
openaire +3 more sources
Link distance and shortest path problems in the plane
Computational Geometry, 2009 AbstractThis paper describes algorithms to compute Voronoi diagrams, shortest path maps, the Hausdorff distance, and the Fréchet distance in the plane with polygonal obstacles. The underlying distance measures for these algorithms are either shortest path distances or link distances.
Atlas F. Cook, Carola Wenk
openaire +5 more sources
A parallel shortest augmenting path algorithm for the assignment problem [PDF]
, 1991 Egon Balas +3 more
openalex +1 more source
An Analysis of Stochastic Shortest Path Problems [PDF]
, 1991 Dimitri P. Bertsekas, John N. Tsitsiklis
openalex +1 more source
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets [PDF]
Journal of Optimization in Industrial Engineering, 2013 A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced
Sadollah Ebrahimnejad +2 more
doaj