Results 291 to 300 of about 280,639 (334)
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.
Yash P. Aneja, K. P. K. Nair
openaire +3 more sources
Solving the shortest path tour problem [PDF]
European Journal of Operational Research, 2013 In this paper, we study the shortest path tour problem in which a shortest path from a given origin node to a given destination node must be found in a directed graph with non-negative arc lengths. Such path needs to cross a sequence of node subsets that are given in a fixed order. The subsets are disjoint and may be different-sized.
Festa P +3 more
openaire +3 more sources
On the Robust Shortest Path Problem
Computers & Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gang Yu, Jian Yang
openaire +3 more sources
2000
Consider a digraph G = (V, E) with non- negative costs c(e) = c ij (∀ e = (i, j) ∈ E) associated with the edges in G. To simplify further notation we define c ij := ∞ for all (i, j) ∉ E.
Kathrin Klamroth, Horst W. Hamacher
openaire +4 more sources
Consider a digraph G = (V, E) with non- negative costs c(e) = c ij (∀ e = (i, j) ∈ E) associated with the edges in G. To simplify further notation we define c ij := ∞ for all (i, j) ∉ E.
Kathrin Klamroth, Horst W. Hamacher
openaire +4 more sources
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 +3 more sources
The constrained shortest path tour problem
Computers & Operations Research, 2016In this paper, we study the constrained shortest path tour problem. Given a directed graph with non-negative arc lengths, the aim is to find a single-origin single-destination shortest path, which needs to cross a sequence of node subsets that are given in a fixed order. The subsets are disjoint and may be of different size. In addition, it is required
Ferone D +3 more
openaire +3 more sources
On a multicriteria shortest path problem
European Journal of Operational Research, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
A note on the constrained shortest‐path problem [PDF]
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.
Arun K. Pujari +2 more
openaire +1 more source
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
Subhash Suri +2 more
openaire +3 more sources
On the dynamic shortest path problem
Journal of Information Processing, 1991Summary: This paper proposes an algorithm to solve the dynamic shortest path problem, which is to perform an arbitrary sequence of two kinds of operations on a directed graph with edges of equal length: the \textit{Insert} operation, which inserts an edge into the graph, and the \textit{FindShortest} operation, which reports the shortest path between a
ChangRuei-Chuan, LinChih-Chung
openaire +3 more sources