On the \(K\) shortest path trees problem

DOI10.1016/j.ejor.2009.06.017zbMath1176.90614OpenAlexW1964122629MaRDI QIDQ1040982

Carlos González-Martín, Antonio Sedeño-Noda

Publication date: 27 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.017

zbMATH Keywords

network/graphs\(K\) best solutions\(K\) best spanning tree\(K\) shortest path trees problemshortest path tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Enumerating \(K\) best paths in length order in DAGs ⋮ Multiple space debris collecting mission -- debris selection and trajectory optimization ⋮ Ranking One Million Simple Paths in Road Networks

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A bicriterion shortest path algorithm
• A new implementation of Yen's ranking loopless paths algorithm
• A note on \(K\) best network flows
• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
• On a routing problem
• Letter to the Editor—The kth Best Route Through a Network
• A Method for the Solution of the N th Best Path Problem
• Implementation of algorithms forK shortest loopless paths
• An Algorithm for Finding K Minimum Spanning Trees
• An efficient algorithm for K shortest simple paths
• Two Algorithms for Generating Weighted Spanning Trees in Order
• An efficient implementation of an algorithm for findingK shortest simple paths
• Scaling Algorithms for the Shortest Paths Problem
• Finding the k shortest simple paths
• Efficient Shortest Path Simplex Algorithms
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

This page was built for publication: On the \(K\) shortest path trees problem