Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty

DOI10.1007/s10878-021-00776-4zbMath1490.90209arXiv1905.02469OpenAlexW3191883188MaRDI QIDQ2125227

Marc Goerigk, Adam Kasperski, Paweł Zieliński

Publication date: 13 April 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.02469

zbMATH Keywords

combinatorial optimizationrobust optimizationtwo-stage optimizationconvex uncertainty

Mathematics Subject Classification ID

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

Related Items (1)

Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust optimization approach for a chance-constrained binary knapsack problem
• Complexity and in-approximability of a selection problem in robust optimization
• Min-max-min robust combinatorial optimization
• On the approximability of robust spanning tree problems
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Commitment under uncertainty: Two-stage stochastic matching problems
• On the approximability of minmax (regret) network optimization problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust solutions of uncertain linear programs
• Geometric algorithms and combinatorial optimization.
• Adjustable robust solutions of uncertain linear programs
• Robust combinatorial optimization with knapsack uncertainty
• On recoverable and two-stage robust selection problems with budgeted uncertainty
• A survey of adjustable robust optimization
• Approximability of the robust representatives selection problem
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Robust combinatorial optimization with locally budgeted uncertainty
• Two-stage combinatorial optimization problems under risk
• Robust recoverable and two-stage selection problems
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Recoverable robust shortest path problems
• On the random 2-stage minimum spanning tree
• An approximation scheme for stochastic linear programming and its application to stochastic integer programs
• K-Adaptability in Two-Stage Robust Binary Programming
• On Two-Stage Stochastic Minimum Spanning Trees
• The Price of Robustness
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
• Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty