On the complexity of robust multi-stage problems with discrete recourse (Q6180695): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.dam.2023.10.018 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2023.10.018 / rank
 
Normal rank

Latest revision as of 19:14, 30 December 2024

scientific article; zbMATH DE number 7782006
Language Label Description Also known as
English
On the complexity of robust multi-stage problems with discrete recourse
scientific article; zbMATH DE number 7782006

    Statements

    On the complexity of robust multi-stage problems with discrete recourse (English)
    0 references
    0 references
    0 references
    0 references
    2 January 2024
    0 references
    robust optimization
    0 references
    multi-stage optimization
    0 references
    robust adjustable optimization
    0 references
    robust recoverable optimization
    0 references
    polynomial hierarchy
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references