Solving robust two-stage combinatorial optimization problems under convex uncertainty

DOI10.1007/978-3-030-48439-2_51zbMath1476.90226OpenAlexW3089607626MaRDI QIDQ2050273

Adam Kasperski, Paweł Zieliński, Marc Goerigk

Publication date: 30 August 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-48439-2_51

zbMATH Keywords

combinatorial optimizationrobust optimizationtwo-stage approachconvex uncertainty

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Related Items (1)

Recoverable robust representatives selection problems with discrete budgeted uncertainty

This page was built for publication: Solving robust two-stage combinatorial optimization problems under convex uncertainty