A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447)

From MaRDI portal
Revision as of 01:04, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
scientific article

    Statements

    A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    0 references
    combinatorial optimization
    0 references
    minmax regret
    0 references
    robust optimization
    0 references
    approximation
    0 references
    robust shortest paths
    0 references
    0 references