Improved Sample-Complexity Bounds in Stochastic Optimization

Learning to Optimize via Information-Directed Sampling

(2018) Daniel Russo et al.   OPERATIONS RESEARCH

A Flocking-Based Approach for Distributed Stochastic Optimization

(2018) Shi Pu et al.   OPERATIONS RESEARCH

Multi-Priority Online Scheduling with Cancellations

(2018) Xinshang Wang et al.   OPERATIONS RESEARCH

Optimal Resource Capacity Management for Stochastic Networks

(2017) A. B. Dieker et al.   OPERATIONS RESEARCH

Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty

(2016) Maxim Raginsky et al.   OPERATIONS RESEARCH

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand

(2016) Vineet Goyal et al.   OPERATIONS RESEARCH

Supply Allocation Under Sequential Advance Demand Information

(2016) Felix Papier   OPERATIONS RESEARCH

Supply Chain Management with Online Customer Selection

(2016) Adam N. Elmachtoub et al.   OPERATIONS RESEARCH

Routing Optimization Under Uncertainty

(2016) Patrick Jaillet et al.   OPERATIONS RESEARCH

Non-Stationary Stochastic Optimization

(2015) Omar Besbes et al.   OPERATIONS RESEARCH

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

(2011) Nikhil Bansal et al.   ALGORITHMICA

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

(2008) Brian C. Dean et al.   MATHEMATICS OF OPERATIONS RESEARCH