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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2023.10.018 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4388580578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / 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 optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Uncertainty Sets for Robust Linear Optimization / 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: Investigating the recoverable robust single machine scheduling problem under interval uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max-min robust combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Knapsack with Interdiction Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recoverable and two-stage robust selection problems with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Quantified Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust min-max regret covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pinpointing the complexity of the interval min-max regret knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage robust discrete optimization via quantified integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust representatives selection problems with discrete budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i>-Adaptability in Two-Stage Robust Binary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust multistage optimization with decision-dependent uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of robust spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust recoverable and two-stage selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the multilevel critical node problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Integer Programming with Alternations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic optimization framework for resilient systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The trouble with the second quantifier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of adjustable robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2023.10.018 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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