Results 251 to 260 of about 286,038 (288)
Some of the next articles are maybe not open access.
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
The shortest path problem algorithm
2022The purpose of this paper is to compare two different techniques for finding the shortest path on maps as artificial intelligence algorithms (Dijkstra's algorithm and the Floyd–Warshall algorithm), explaining the advantages and disadvantages of each.
openaire +1 more source
The alpha-shortest path problem
2008Many real-life applications, arising in transportation and telecommunication systems, can be mathematically represented as shortest path problems. The deterministic version of the problem, where a deterministic cost is associated to each arc and the configuration of the network (nodes and arcs) is assumed to be known in advance, is easy to solve and ...
BERALDI, Patrizia, GUERRIERO, Francesca
openaire +1 more source