A new implementation of Yen's ranking loopless paths algorithm

DOI10.1007/S10288-002-0010-2MaRDI QIDQ1432016zbMATH OpenOpenAlexFDO

Authors Ernesto Queirós Vieira Martins, Marta M. B. Pascoal

Publication date 11 June 2004

Published in 4OR (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10316/7763

zbMATH Keywords

networkloopless pathpaths ranking

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Paths and cycles (05C38)

Recommendations

• Implementation of algorithms forK shortest loopless paths
• An algorithm for the ranking of shortest paths
• Finding the K Shortest Loopless Paths in a Network
• An algorithm for ranking paths that may contain cycles
• Near-shortest and K-shortest simple paths

Cited in

(25)

• An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem
• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• A power penalty method for the general traffic assignment problem with elastic demand
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• Robust capacity assignment solutions for telecommunications networks with uncertain demands
• Generating price-effective intermodal routes
• Solving the edge‐disjoint paths problem using a two‐stage method
• 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
• An efficient time and space K point-to-point shortest simple paths algorithm
• On the \(K\) shortest path trees problem
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• An algorithm for the ranking of shortest paths
• Deviation algorithms for ranking shortest 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
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
• Ranking robustness and its application to evacuation planning
• Ranking One Million Simple Paths in Road Networks
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• Mixed-integer nonlinear programs featuring ``on/off constraints
• The gateway location problem: assessing the impact of candidate site selection policies

This page was built for publication: A new implementation of Yen's ranking loopless paths algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1432016)