Robust Combinatorial Optimization with Exponential Scenarios

DOI10.1007/978-3-540-72792-7_33zbMath1136.90451OpenAlexW1604332079MaRDI QIDQ5429285

No author found.

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_33

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (30)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ K-Adaptability in Two-Stage Robust Binary Programming ⋮ On the approximability of adjustable robust convex optimization under uncertainty ⋮ When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? ⋮ LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ Universal Algorithms for Clustering Problems ⋮ A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization ⋮ Two-stage robust network design with exponential scenarios ⋮ On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints ⋮ Approximating max-min weighted \(T\)-joins ⋮ Approximating Single Machine Scheduling with Scenarios ⋮ Two-stage robust optimization for the orienteering problem with stochastic weights ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ Robust fault tolerant uncapacitated facility location ⋮ Robust multicovers with budgeted uncertainty ⋮ Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard ⋮ An \(s\)-\(t\) connection problem with adaptability ⋮ Permutation betting markets: singleton betting with extra information ⋮ On the power and limitations of affine policies in two-stage adaptive optimization ⋮ Robust resource allocations in temporal networks ⋮ Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty ⋮ Bulk-robust combinatorial optimization ⋮ On the performance of affine policies for two-stage adaptive optimization: a geometric perspective ⋮ On the power of static assignment policies for robust facility location problems ⋮ Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios ⋮ On the Optimality of Affine Policies for Budgeted Uncertainty Sets ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations ⋮ Technical Note—Two-Stage Sample Robust Optimization

This page was built for publication: Robust Combinatorial Optimization with Exponential Scenarios