Results 231 to 240 of about 23,111 (264)

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

A note on the constrained shortest‐path problem

Naval Research Logistics Quarterly, 1984
AbstractThe 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., Agarwal, Suneeta, Gulati, V. P.   +2 more
openaire   +1 more source

On the shortest path problem for permutation graphs

[1993] Proceedings Seventh International Parallel Processing Symposium, 2002
The 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

Uncertain random shortest path problem

Soft Computing, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuhong Sheng, Xuehui Mei
openaire   +1 more source

The Shortest Path Problems

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 shortest path problem.

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

An efficient exact approach for the constrained shortest path tour problem

Optimization Methods and Software, 2020
Paola Festa, Francesca Guerriero, Daniele Ferone   +2 more
exaly  

Shortest path problem with uncertain arc lengths

Computers and Mathematics With Applications, 2011
Yuan Gao
exaly  

An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints

Transportation Science, 2016
Leonardo Lozano, Andres L Medaglia, Daniel Duque   +2 more
exaly  

The computational complexity of the relative robust shortest path problem with interval data

European Journal of Operational Research, 2004
Pawel Zielinski
exaly