Fast and fine quickest path algorithm

We address the quickest path problem proposing a new algorithm based on the fact that its optimal solution corresponds to a supported non-dominated point in the objective space of the minsum–maxmin bicriteria path problem. This result allows us to design a label setting algorithm which improves all existing algorithms in the state-of-the-art, as it is shown in the extensive experiments carried out considering synthetic and real networks.

MoreLess

Year of publication:	2014
Authors:	Sedeño-Noda, Antonio ; González-Barrera, Jonathan D.
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 238.2014, 2, p. 596-606
Publisher:	Elsevier
Subject:	OR in telecommunications \| Quickest path \| Supported non-dominated path

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011052826