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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2016.03.007 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C47 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6640255 / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2396547373 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2016.03.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:27, 9 December 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