The following pages link to Boosted sampling (Q3580986):
Displaying 20 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- Towards an algorithmic synthesis of thermofluid systems (Q2139127) (← links)
- On stochastic \(k\)-facility location (Q2151361) (← links)
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)
- The \(k\)-level facility location game (Q2466591) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models (Q5219734) (← links)
- (Q5875455) (← links)
