Robust Combinatorial Optimization with Exponential Scenarios
From MaRDI portal
Recommendations
- Two-stage robust network design with exponential scenarios
- Two-Stage Robust Network Design with Exponential Scenarios
- Thresholded covering algorithms for robust and max-min optimization
- Thresholded Covering Algorithms for Robust and Max-min Optimization
- Solving robust two-stage combinatorial optimization problems under convex uncertainty
Cited in
(42)- Approximating Single Machine Scheduling with Scenarios
- An s-t connection problem with adaptability
- On the approximability of adjustable robust convex optimization under uncertainty
- Robust resource allocations in temporal networks
- Adaptive-adversary-robust algorithms via small copy tree embeddings
- Two-stage robust optimization for the orienteering problem with stochastic weights
- Permutation betting markets: singleton betting with extra information
- General polyhedral approximation of two-stage robust linear programming for budgeted uncertainty
- Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
- Approximating max-min weighted \(T\)-joins
- Approximation algorithms for stochastic combinatorial optimization problems
- K-adaptability in two-stage robust binary programming
- Robust strategic planning for mobile medical units with steerable and unsteerable demands
- Robust multicovers with budgeted uncertainty
- Thresholded covering algorithms for robust and max-min optimization
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
- Bulk-robust combinatorial optimization
- Thrifty algorithms for multistage robust optimization
- Value of intermediate imaging in adaptive robust radiotherapy planning to manage radioresistance
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
- Universal Algorithms for Clustering Problems
- Robust algorithms for TSP and Steiner tree
- Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- Two-stage robust network design with exponential scenarios
- Towards distributed two-stage stochastic optimization
- On the optimality of affine policies for budgeted uncertainty sets
- On scenario aggregation to approximate robust combinatorial optimization problems
- On the power of static assignment policies for robust facility location problems
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Two-Stage Robust Network Design with Exponential Scenarios
- On the power and limitations of affine policies in two-stage adaptive optimization
- A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
- Recoverable Robust Combinatorial Optimization Problems
- Technical note -- two-stage sample robust optimization
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust fault tolerant uncapacitated facility location
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
- On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
This page was built for publication: Robust Combinatorial Optimization with Exponential Scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429285)
