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

From MaRDI portal
Revision as of 15:14, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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