Results 261 to 270 of about 32,185 (303)

A note on k-shortest paths problem

Journal of Graph Theory, 2010
Summary: It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices \(s\) and \(t\), then there are two edge-disjoint paths from \(s\) to \(t\) and both of them are shortest paths.
Nick Gravin, Ning Chen 0005
openaire   +1 more source

Shortest path tour problem with time windows

European Journal of Operational Research, 2020
This paper aims at studying a new variant of the shortest path tour problem, where time window constraints are taken into account. This is the first work dealing with the shortest path tour problem with time windows. The problem is formally described and
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa   +2 more
exaly   +2 more sources

The Fixed-Charge Shortest-Path Problem

INFORMS Journal on Computing, 2012
Consider a network 𝒩 =(N, A) and associate with each arc e ∈ A a fixed cost ce for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost [Formula: see text] for resource consumed along e.
Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song   +3 more
openaire   +2 more sources

Computation of the Reverse Shortest-Path Problem

Journal of Global Optimization, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianzhong Zhang 0001, Yixun Lin
openaire   +1 more source

The multiple shortest path problem with path deconfliction

European Journal of Operational Research, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael S. Hughes, Brian J. Lunday, Jeffrey D. Weir, Kenneth M. Hopkinson   +3 more
openaire   +2 more sources

A new algorithm for the shortest‐path problem

Networks, 2018
AbstractIn this article we propose a new single‐source shortest‐path algorithm that achieves the same O(n · m) time bound as the Bellman‐Ford‐Moore algorithm but outperforms it and other state‐of‐the‐art algorithms in many cases in practice. Our claims are supported by experimental evidence.
Amr Elmasry, Ahmed Shokry
openaire   +2 more sources

The Variance-Constrained Shortest Path Problem

Transportation Science, 1994
This 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.
Raj A. Sivakumar, Rajan Batta
openaire   +2 more sources

Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing, 1995
Summary: 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   +2 more sources

Shortest Path Problems

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.
Horst W. Hamacher, Kathrin Klamroth
openaire   +2 more sources

A note on shortest path problems with forbidden paths

Networks, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olivia J. Smith, Martin W. P. Savelsbergh   +1 more
openaire   +1 more source