Results 271 to 280 of about 32,185 (303)
Some of the next articles are maybe not open access.
Constrained shortest paths and related problems
2001The 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
A note on the constrained shortest‐path problem
Naval Research Logistics Quarterly, 1984AbstractThe subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest‐path problem.
Pujari, Arun K. +2 more
openaire +1 more source
On the shortest path problem for permutation graphs
[1993] Proceedings Seventh International Parallel Processing Symposium, 2002The authors show that the single-source shortest path problem for permutation graphs can be solved in O(logn) time using O(n/logn) processors on an EREW PRAM. As an application, they show that a minimum connected dominating set of a permutation graph can be found in O(logn) time using O(n/logn) processors. The algorithms are optimal with respect to the
Oscar H. Ibarra, Qi Zheng 0001
openaire +1 more source
Stochastic Safest and Shortest Path Problems
Proceedings of the AAAI Conference on Artificial Intelligence, 2021Optimal solutions to Stochastic Shortest Path Problems (SSPs) usually require that there exists at least one policy that reaches the goal with probability 1 from the initial state. This condition is very strong and prevents from solving many interesting problems, for instance where all possible policies reach some dead-end states with a
openaire +1 more source
Uncertain random shortest path problem
Soft Computing, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuhong Sheng, Xuehui Mei
openaire +1 more source
1970
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +1 more source
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +1 more source
A note on the problem of updating shortest paths
Networks, 1981AbstractThe problem of updating shortest paths from all the vertices to a set of vertices when the length function is decreased was considered by S. Goto and A. Sangiovanni‐Vincentelli and a solution algorithm was presented based on the LU‐factorization of the measure matrix and a matrix inversion formula.
openaire +1 more source
Ann. UMCS Informatica, 2003
Artykuł z : Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica, Vol. 1 (2003), s. 297-301 ; Artykuł z : Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica, Vol. 1 (2003), s.
openaire +1 more source
Artykuł z : Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica, Vol. 1 (2003), s. 297-301 ; Artykuł z : Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica, Vol. 1 (2003), s.
openaire +1 more source
An efficient exact approach for the constrained shortest path tour problem
Optimization Methods and Software, 2020Daniele Ferone +2 more
exaly
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
Transportation Science, 2016Leonardo Lozano +2 more
exaly