Results 251 to 260 of about 32,185 (303)
Solving the shortest path tour problem
European Journal of Operational Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Festa P +3 more
openaire +4 more sources
Shortest path problem with uncertain arc lengths
Computers and Mathematics With Applications, 2011 Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it
Yuan Gao
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The shortest path problem with forbidden paths
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Villeneuve, Guy Desaulniers
openaire +3 more sources
On the Robust Shortest Path Problem
Computers & Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Gang, Yang Jian
openaire +2 more sources
On the difficulty of some shortest path problems
ACM Transactions on Algorithms, 2003We prove superlinear lower bounds for some shortest path problems in directed graphs, where no such bounds were previously known. The central problem in our study is the replacement paths problem: Given a directed graph G with non-negative edge weights, and a shortest path P
John Hershberger 0001 +2 more
openaire +1 more source
On Bounded Leg Shortest Paths Problems
Algorithmica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liam Roditty, Michael Segal 0001
openaire +3 more sources
Shortest Paths with Shortest Detours
Journal of Optimization Theory and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani +3 more
openaire +1 more source
On the Shortest Path Problems with Edge Constraints
2020 22nd International Conference on Transparent Optical Networks (ICTON), 2020The goal of this work is to provide a brief classification of some Shortest Path Problem (SPP) variants that include edge constraints and that find applications in several different contexts, including optical networks, transportation and logistics.
Ferone D. +3 more
openaire +2 more sources
, 2015 The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the i-dimensional space of ...
Hector Ortega-Arranz +2 more
openaire +3 more sources