A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for a Class of Robust Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online makespan minimization with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted sum of completion times under processing time uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust constrained shortest path problems under budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition for adjustable robust linear optimization subject to uncertainty polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance-based linear formulation for the anchor-robust project scheduling problem / 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: A compact reformulation of the two-stage robust resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for makespan minimization with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust scheduling with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine robust scheduling with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty / 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: Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems with balanced regret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty / 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: Two-stage robust optimization problems with two-stage uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust basic cyclic scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions for the two-machine robust flow shop with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust combinatorial optimization with variable budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty / rank
 
Normal rank

Latest revision as of 15:58, 29 August 2024

scientific article; zbMATH DE number 7826723
Language Label Description Also known as
English
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
scientific article; zbMATH DE number 7826723

    Statements

    A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    2 April 2024
    0 references
    discrete optimization
    0 references
    uncertainty
    0 references
    selection problem
    0 references
    min-max-min
    0 references
    two-stage
    0 references
    robustness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references