Time version of the shortest path problem in a stochastic-flow network (Q1019780): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2008.09.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Minimum cost-reliability ratio path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Evaluation of Multistate Systems with Multistate Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the \(k\) quickest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) quickest simple paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum time paths in a network with mixed time constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internet packet routing: application of a \(K\)-quickest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Bounds for Multistate Systems with Multistate Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability evaluation of a limited-flow network in terms of minimal cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pairs quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A label-setting algorithm for finding a quickest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for ranking quickest simple paths / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2008.09.003 / rank
 
Normal rank

Latest revision as of 13:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Time version of the shortest path problem in a stochastic-flow network
scientific article

    Statements

    Time version of the shortest path problem in a stochastic-flow network (English)
    0 references
    0 references
    28 May 2009
    0 references
    shortest path
    0 references
    quickest path
    0 references
    two minimal paths
    0 references
    time constraint
    0 references
    stochastic-flow network
    0 references

    Identifiers