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

From MaRDI portal
Revision as of 00:43, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references