Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047112290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / 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: 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: Algorithms for the constrained quickest path problem and the enumeration of quickest paths / 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: 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: An algorithm for ranking quickest simple paths / 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: On the quickest path problem / 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: Reliability Bounds for Multistate Systems with Multistate Components / 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: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution of random graph processes with degree constraints / rank
 
Normal rank

Latest revision as of 15:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
scientific article

    Statements

    Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (English)
    0 references
    0 references
    19 March 2010
    0 references
    0 references
    quickest path
    0 references
    time threshold
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references