Results 211 to 220 of about 23,111 (264)

On the K shortest path trees problem [PDF]

open access: yesEuropean Journal of Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio SedeƱo-Noda
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

The shortest path problem with forbidden paths

European Journal of Operational Research, 2005
zbMATH 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, 1998
zbMATH 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, 2003
We 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, 2009
zbMATH 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, 2017
zbMATH 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), 2020
The 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

Home - About - Disclaimer - Privacy