Hedging uncertainty: approximation algorithms for stochastic optimization problems
From MaRDI portal
Publication:2494510
Recommendations
- Integer Programming and Combinatorial Optimization
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- scientific article; zbMATH DE number 6381764
- Sampling-based approximation algorithms for multistage stochastic optimization
- Approximation algorithms for stochastic and risk-averse optimization
Cites work
- A Dual-Based Procedure for Stochastic Facility Location
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
- A note on two problems in connexion with graphs
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Allocating Bandwidth for Bursty Connections
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network
- Approximation algorithms for combinatorial problems
- Approximation in stochastic scheduling
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Automata, Languages and Programming
- Bin packing can be solved within 1+epsilon in linear time
- Boosted sampling
- Facility location with service installation costs
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 1405785 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- Improved low-degree testing and its applications
- Integer Programming and Combinatorial Optimization
- Introduction to Stochastic Programming
- Multicommodity facility location
- Network design for information networks
- On Two-Stage Stochastic Minimum Spanning Trees
- Primal-dual algorithms for connected facility location problems
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- Scenario reduction algorithms in stochastic programming
- Some optimal inapproximability results
- Stochastic Machine Scheduling with Precedence Constraints
- Two‐stage stochastic integer programming: a survey
Cited in
(54)- Stochastic survivable network design problems: theory and practice
- Improved bounds in stochastic matching and optimization
- A priori TSP in the scenario model
- Two-stage robust network design with exponential scenarios
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- An improved per-scenario bound for the two-stage stochastic facility location problem
- Approximation algorithm for stochastic set cover problem
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- The submodularity of two-stage stochastic maximum-weight independent set problems
- On stochastic k-facility location
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- Mobile facility location: combinatorial filtering via weighted occupancy
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- Approximation algorithms for \(k\)-level stochastic facility location problems
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Approximation algorithm for the 2-stage stochastic matroid base problem
- Approximation algorithm for the stochastic prize-collecting set multicover problem
- Effective approximation methods for constrained utility maximization with drift uncertainty
- Approximation algorithms for the stochastic priority facility location problem
- Approximation algorithms for stochastic combinatorial optimization problems
- An approximation algorithm for the two-stage distributionally robust facility location problem
- A priori TSP in the Scenario Model
- Sampling and cost-sharing: approximation algorithms for stochastic optimization problems
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation algorithms for reliable stochastic combinatorial optimization
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- Thresholded covering algorithms for robust and max-min optimization
- Stochastic uncapacitated hub location
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem
- Approximation algorithms for stochastic and risk-averse optimization
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- The discrete sell or hold problem with constraints on asset values
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- When the optimum is also blind: a new perspective on universal optimization
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- Sampling-based approximation schemes for capacitated stochastic inventory control models
- scientific article; zbMATH DE number 7064063 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- The facility location problem with maximum distance constraint
- An approximation algorithm for the k-level stochastic facility location problem
- On the approximability of robust spanning tree problems
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
- Approximation algorithm for two-stage stochastic fault-tolerant facility location problem
- Approximation algorithm for fair stochastic maximum coverage problem
- Approximating per-scenario bound for the two-stage stochastic facility location problem
- Towards distributed two-stage stochastic optimization
- Inventory placement on a network
- Two-stage stochastic stable matching
- An approximation algorithm for the stochastic fault-tolerant facility location problem
This page was built for publication: Hedging uncertainty: approximation algorithms for stochastic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494510)
