Enumerating \(K\) best paths in length order in DAGs
From MaRDI portal
Publication:1926859
DOI10.1016/j.ejor.2012.04.001zbMath1253.90201MaRDI QIDQ1926859
Marta M. B. Pascoal, Antonio Sedeño-Noda
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.001
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Ranking One Million Simple Paths in Road Networks, An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem, Solving a constrained economic lot size problem by ranking efficient production policies, Theory and application of reciprocal transformation of “path problem” and “time float problem”
Uses Software
Cites Work
- Unnamed Item
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- Multi-objective evacuation routing in transportation networks
- The one-dimensional cutting stock problem with due dates
- On the \(K\) shortest path trees problem
- On computing all suboptimal alignments
- A new implementation of Yen's ranking loopless paths algorithm
- Shortest paths algorithms: Theory and experimental evaluation
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
- Letter to the Editor—The kth Best Route Through a Network
- A Method for the Solution of the N th Best Path Problem
- Sequence alignments in the neighborhood of the optimum with general application to dynamic programming
- 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
- Finding the k shortest simple paths
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- 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
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
