A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

DOI10.1016/j.dam.2024.02.005OpenAlexW4391737885MaRDI QIDQ6130218

Evgeny E. Gurevsky, Nadia Brauner, Mikhail Y. Kovalyov

Publication date: 2 April 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.02.005

zbMATH Keywords

uncertaintyselection problemrobustnessdiscrete optimizationtwo-stagemin-max-min

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Operations research and management science (90Bxx)

Cites Work

• A robust basic cyclic scheduling problem
• Online makespan minimization with budgeted uncertainty
• Robust discrete optimization and network flows
• A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
• On recoverable and two-stage robust selection problems with budgeted uncertainty
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
• Minimizing the weighted sum of completion times under processing time uncertainty
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• Robust combinatorial optimization with variable budgeted uncertainty
• A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem
• Two-stage robust optimization problems with two-stage uncertainty
• Recoverable robust representatives selection problems with discrete budgeted uncertainty
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
• Dominance-based linear formulation for the anchor-robust project scheduling problem
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
• Robust scheduling with budgeted uncertainty
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
• A compact reformulation of the two-stage robust resource-constrained project scheduling problem
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty
• Combinatorial optimization problems with balanced regret
• A Dynamic Programming Approach for a Class of Robust Optimization Problems
• The Price of Robustness
• Robust constrained shortest path problems under budgeted uncertainty
• Approximation results for makespan minimization with budgeted uncertainty
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
• Single machine robust scheduling with budgeted uncertainty

This page was built for publication: A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty