An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2015.05.109 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W606997861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an exact method for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of resource constrained shortest path problems: Exact solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple efficient approximation scheme for the restricted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating \(K\) best paths in length order in DAGs / rank
 
Normal rank

Revision as of 10:26, 16 July 2024

scientific article
Language Label Description Also known as
English
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
scientific article

    Statements

    An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (English)
    0 references
    24 August 2018
    0 references
    constrained shortest paths
    0 references
    shortest path algorithms
    0 references
    ranking best solutions
    0 references

    Identifiers