Uncertainty reduction in robust optimization

DOI10.1016/J.ORL.2024.107131MaRDI QIDQ6988639zbMATH OpenFDO

Authors Ayşe Nur Arslan, Michael Poss

Publication date 3 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107131

zbMATH Keywords

combinatorial optimizationrobust optimizationNP-hardnessreformulation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Robustness in mathematical programming (90C17)

Cites work

• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• JuMP 1.0: recent improvements to a modeling language for mathematical optimization
• Optimization under decision-dependent uncertainty
• Parallelizing the dual revised simplex method
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Robust combinatorial optimization with knapsack uncertainty
• Robust combinatorial optimization with variable budgeted uncertainty
• Robust combinatorial optimization with variable cost uncertainty
• Robust software partitioning with multiple instantiation
• Robust solutions of uncertain linear programs
• The Price of Robustness
• K-adaptability in two-stage robust binary programming

Cited in

(1)

• The robust selection problem with information discovery

This page was built for publication: Uncertainty reduction in robust optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988639)