A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725)

From MaRDI portal
Revision as of 23:58, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the robust shortest path problem with interval data.
scientific article

    Statements

    A branch and bound algorithm for the robust shortest path problem with interval data. (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2004
    0 references
    0 references
    Branch and bound
    0 references
    Shortest path problem
    0 references
    Robust optimization
    0 references
    Interval data
    0 references