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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089903952 / rank
 
Normal rank

Revision as of 00:04, 20 March 2024

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
    combinatorial optimization
    0 references
    minmax regret
    0 references
    robust optimization
    0 references
    approximation
    0 references
    robust shortest paths
    0 references

    Identifiers