Approximation Algorithms for Stochastic and Risk-Averse Optimization

DOI10.1137/15M1043790zbMath1387.68297arXiv1712.06996OpenAlexW2782292024MaRDI QIDQ4601213

Jaroslaw Byrka, Aravind Srinivasan

Publication date: 12 January 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

stochastic optimizationfacility locationapproximation algorithmsset cover

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ Approximation algorithm for squared metric two-stage stochastic facility location problem

Uses Software

• SUTIL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Correlation inequalities on some partially ordered sets
• The sample average approximation method applied to stochastic routing problems: a computational study
• Computational complexity of stochastic programming problems
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• The empirical behavior of sampling methods for stochastic programming
• Linear Programming under Uncertainty
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
• Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization
• Approximation in stochastic scheduling
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Approximation Algorithms for Metric Facility Location Problems
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• An approximation scheme for stochastic linear programming and its application to stochastic integer programs
• A new greedy approach for facility location problems
• Greedy Strikes Back: Improved Facility Location Algorithms
• Optimal File Sharing in Distributed Networks
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Introduction to Stochastic Programming
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Monte Carlo sampling approach to stochastic programming
• Improved Approximation Guarantees for Packing and Covering Integer Programs
• Approximation Algorithms for 2-Stage Stochastic Optimization Problems
• LP Rounding Approximation Algorithms for Stochastic Network Design
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
• Stochastic Combinatorial Optimization with Controllable Risk Aversion Level

This page was built for publication: Approximation Algorithms for Stochastic and Risk-Averse Optimization