Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean Decomposition for Mean-Variance Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank

Revision as of 17:41, 12 July 2024

scientific article
Language Label Description Also known as
English
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
scientific article

    Statements

    Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (English)
    0 references
    0 references
    0 references
    18 October 2016
    0 references
    robust optimization
    0 references
    combinatorial optimization
    0 references
    complexity
    0 references

    Identifiers