Results 221 to 230 of about 22,360 (263)
Some of the next articles are maybe not open access.
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
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
Uncertain random shortest path problem
Soft Computing, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng, Yuhong, Mei, Xuehui
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
Stochastic shortest-path problems
1991Abstract The final section of Chapter 8 introduced multistate systems: those in which the components assume a finite number of distinct modes. One particular instance of this type of system frequently arises in the modelling of various transportation, communication, and project planning networks.
openaire +1 more source
The shortest path problem with forbidden paths
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Villeneuve, Daniel, Desaulniers, Guy
openaire +3 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
Fuzzy shortest path problems incorporating interactivity among paths
Fuzzy Sets and Systems, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
$K$ Constrained Shortest Path Problem
IEEE Transactions on Automation Science and Engineering, 2010Motivated by a real project for a sophisticated automated storage and retrieval system (AS/RS), we study the problem of generating K shortest paths that are required to satisfy a set of constraints. We propose a structural branching procedure that decomposes the problem into at most K|N| subproblems, where |N| is the number of nodes in the network.
openaire +1 more source
Recoverable robust shortest path problems
Networks, 2011AbstractIn this article, we investigate two different recoverable robust (RR) models to deal with cost uncertainties in a shortest path problem. RR extends the classical concept of robustness to deal with uncertainties by incorporating limited recovery actions after the full data are revealed.
openaire +2 more sources