Distributionally robust resource planning under binomial demand intakes
From MaRDI portal
Publication:2106736
DOI10.1016/J.EJOR.2022.08.019OpenAlexW3187128001MaRDI QIDQ2106736FDOQ2106736
Authors: Ben Black, Russell Ainslie, Trivikram Dokka, Christopher Kirkbride 
Publication date: 19 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03949
Cites Work
- Inventory management under highly uncertain demand
- Minimax analysis of stochastic problems
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Data-driven chance constrained stochastic program
- Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand
- Distributionally robust workforce scheduling in call centres with uncertain arrival rates
- The implementor/adversary algorithm for the cyclic and robust scheduling problem in health-care
- Scheduling operating rooms: achievements, challenges and pitfalls
- Ambiguity in portfolio selection
- Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances
- Maximum likelihood estimation and inference. With examples in R, SAS and ADMB
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- A robust optimization model for managing elective admission in a public hospital
- Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
- Algorithms for the solution of stochastic dynamic minimax problems
- Two-stage workforce planning under demand fluctuations and uncertainty
- Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Frameworks and results in distributionally robust optimization
- On the performance of binomial and beta-binomial models of demand forecasting for multiple slow-moving inventory items
Cited In (1)
Uses Software
This page was built for publication: Distributionally robust resource planning under binomial demand intakes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106736)
