Enumerating \(K\) best paths in length order in DAGs (Q1926859): Difference between revisions

@@ Property / author @@
+Antonio Sedeño-Noda
@@ Property / author: Antonio Sedeño-Noda / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2012.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1998132631
@@ Property / OpenAlex ID: W1998132631 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
+Normal rank
@@ Property / cites work @@
+On computing all suboptimal alignments
@@ Property / cites work: On computing all suboptimal alignments / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths algorithms: Theory and experimental evaluation
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Generating Weighted Spanning Trees in Order
+Normal rank
@@ Property / cites work @@
+Choquet-based optimisation in multiobjective shortest path and spanning tree problems
+Normal rank
@@ Property / cites work @@
+Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
+Normal rank
@@ Property / cites work @@
+Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
+Normal rank
@@ Property / cites work @@
+An efficient implementation of an algorithm for findingK shortest simple paths
+Normal rank
@@ Property / cites work @@
+Finding the             <i>k</i>             shortest simple paths
@@ Property / cites work: Finding the <i>k</i> shortest simple paths / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for the Solution of the             <i>N</i>             th Best Path Problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Finding <i>K</i> Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for K shortest simple paths
+Normal rank
@@ Property / cites work @@
+A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
@@ Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / rank @@
+Normal rank
@@ Property / cites work @@
+A new implementation of Yen's ranking loopless paths algorithm
+Normal rank
@@ Property / cites work @@
+Implementation of algorithms forK shortest loopless paths
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—The <i>k</i>th Best Route Through a Network
+Normal rank
@@ Property / cites work @@
+The one-dimensional cutting stock problem with due dates
+Normal rank
@@ Property / cites work @@
+On the \(K\) shortest path trees problem
@@ Property / cites work: On the \(K\) shortest path trees problem / rank @@
+Normal rank
@@ Property / cites work @@
+SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
+Normal rank
@@ Property / cites work @@
+Multi-objective evacuation routing in transportation networks
+Normal rank
@@ Property / cites work @@
+Integer priority queues with decrease key in constant time and the single source shortest paths problem
+Normal rank
@@ Property / cites work @@
+Sequence alignments in the neighborhood of the optimum with general application to dynamic programming
+Normal rank
@@ Property / cites work @@
+Finding the <i>K</i> Shortest Loopless Paths in a Network
+Normal rank