Results 321 to 330 of about 569,188 (376)
Some of the next articles are maybe not open access.
Thek-centrum shortest path problem
TOP, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Garfinkel, Robert +2 more
openaire +1 more source
The Variance-Constrained Shortest Path Problem
Transportation Science, 1994This paper discusses the variance-constrained shortest path problem. This problem can be used to model any application in which the travel costs on a link are not deterministic, but follow a distribution that has possible correlation with travel cost on other links.
Sivakumar, Raj A., Batta, Rajan
openaire +2 more sources
Variations on the Stochastic Shortest Path Problem
International Conference on Verification, Model Checking and Abstract Interpretation, 2014In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the distribution of ...
Mickael Randour +2 more
semanticscholar +1 more source
Solving the shortest path tour problem
European Journal of Operational Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Festa P +3 more
openaire +3 more sources
Solvingk-shortest and constrained shortest path problems efficiently
Annals of Operations Research, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skiscim, Christopher C. +1 more
openaire +2 more sources
Shortest path problem with forbidden paths: The elementary version
European Journal of Operational Research, 2013This paper addresses the elementary shortest path problem with forbidden paths. The main aim is to find the shortest paths from a single origin node to every other node of a directed graph, such that the solution does not contain any path belonging to a given set (i.e.; the forbidden set).
Di Puglia Pugliese L, Guerriero F
openaire +2 more sources
The constrained shortest path problem
Naval Research Logistics Quarterly, 1978AbstractThe shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case.
Aneja, Y. P., Nair, K. P. K.
openaire +2 more sources
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 +2 more sources
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing, 1995Summary: We describe a new method for designing scaling algorithms for the single- source shortest paths problem and use this method to obtain an \(O (\sqrt nm \log N)\) algorithm for the problem. (Here \(n\) and \(m\) are the number of nodes and arcs in the input network and \(N\) is essentially the absolute value of the most negative arc length: arc ...
openaire +1 more source
Reoptimization procedures in shortest path problem
Rivista di Matematica per le Scienze Economiche e Sociali, 1980In most algorithms for Transportation and Communication Models a sequence of Shortest Path Problems must be solved, where each problem is only slightly different from the preceding. Computational procedures are proposed to find the new shortest paths starting from the old shortest paths in two cases: i) the node from which the shortest paths are to be ...
openaire +2 more sources