Integer and combinatorial optimization
Integer and combinatorial optimization
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Mathematics of Operations Research
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Operations Research
Adjustable robust solutions of uncertain linear programs
Mathematical Programming: Series A and B
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Manufacturing & Service Operations Management
A Robust Optimization Approach to Inventory Theory
Operations Research
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
Inventory management under highly uncertain demand
Operations Research Letters
Robust solutions of uncertain linear programs
Operations Research Letters
Robust Approximation to Multiperiod Inventory Management
Operations Research
Production planning in furniture settings via robust optimization
Computers and Operations Research
Theory and Applications of Robust Optimization
SIAM Review
Robust Inventory Routing Under Demand Uncertainty
Transportation Science
The robust vehicle routing problem with time windows
Computers and Operations Research
Robust Modified Policy Iteration
INFORMS Journal on Computing
| Hi-index | 0.00 |
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decomposition that scale well to problems with hundreds of time periods, and theoretical results on more general models.