Two-stage combinatorial optimization problems under risk
From MaRDI portal
Publication:2283029
DOI10.1016/j.tcs.2019.10.035zbMath1436.90122arXiv1812.07826OpenAlexW2982124149MaRDI QIDQ2283029
Marc Goerigk, Paweł Zieliński, Adam Kasperski
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.07826
stochastic programmingcombinatorial optimizationrobust optimizationtwo-stage problemsoptimization under risk
Related Items (4)
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Two-stage robust optimization problems with two-stage uncertainty ⋮ An approach to the distributionally robust shortest path problem ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity and in-approximability of a selection problem in robust optimization
- On the approximability of robust spanning tree problems
- Commitment under uncertainty: Two-stage stochastic matching problems
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Adjustable robust solutions of uncertain linear programs
- Stochastic linear programming. Models, theory, and computation
- Approximability of the robust representatives selection problem
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Risk-averse single machine scheduling: complexity and approximation
- Robust recoverable and two-stage selection problems
- A threshold of ln n for approximating set cover
- On the random 2-stage minimum spanning tree
- On Two-Stage Stochastic Minimum Spanning Trees
- The Recognition of Series Parallel Digraphs
- Probability and Computing
This page was built for publication: Two-stage combinatorial optimization problems under risk
