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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing all suboptimal alignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choquet-based optimisation in multiobjective shortest path and spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of an algorithm for findingK shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>k</i> shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Solution of the <i>N</i> th Best Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding <i>K</i> Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for K shortest simple paths / rank
 
Normal rank
Property / cites work
 
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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation of Yen's ranking loopless paths algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of algorithms forK shortest loopless paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The <i>k</i>th Best Route Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-dimensional cutting stock problem with due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(K\) shortest path trees problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective evacuation routing in transportation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence alignments in the neighborhood of the optimum with general application to dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank

Latest revision as of 00:32, 6 July 2024

scientific article
Language Label Description Also known as
English
Enumerating \(K\) best paths in length order in DAGs
scientific article

    Statements

    Enumerating \(K\) best paths in length order in DAGs (English)
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    combinatorial optimization
    0 references
    shortest path algorithms
    0 references
    \(K\) best solutions
    0 references
    0 references

    Identifiers