A new implementation of Yen's ranking loopless paths algorithm
From MaRDI portal
Publication:1432016
DOI10.1007/s10288-002-0010-2zbMath1044.05064OpenAlexW2052120747MaRDI QIDQ1432016
Marta M. B. Pascoal, Ernesto Queirós Vieira Martins
Publication date: 11 June 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/7763
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (22)
The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ Fast computation of bounds for two-terminal network reliability ⋮ Optimal deployment of alternative fueling stations on transportation networks considering deviation paths ⋮ A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem ⋮ Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty ⋮ Robust delay-constrained routing in telecommunications ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Ranking robustness and its application to evacuation planning ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks ⋮ A power penalty method for the general traffic assignment problem with elastic demand ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Mixed-integer nonlinear programs featuring ``on/off constraints ⋮ The gateway location problem: assessing the impact of candidate site selection policies ⋮ An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs ⋮ Robust capacity assignment solutions for telecommunications networks with uncertain demands ⋮ On the \(K\) shortest path trees problem ⋮ Ranking One Million Simple Paths in Road Networks ⋮ An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem
This page was built for publication: A new implementation of Yen's ranking loopless paths algorithm
