The computational complexity of the relative robust shortest path problem with interval data (Q596264)

From MaRDI portal
Revision as of 20:23, 1 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
The computational complexity of the relative robust shortest path problem with interval data
scientific article

    Statements

    The computational complexity of the relative robust shortest path problem with interval data (English)
    0 references
    0 references
    10 August 2004
    0 references
    0 references
    Combinatorial optimization
    0 references
    Robust optimization
    0 references
    Shortest path problem
    0 references
    Interval data
    0 references
    Computational complexity
    0 references