An optimal stocking problem to minimize the expected time to sellout
From MaRDI portal
Publication:2661592
DOI10.1016/j.orl.2020.11.006OpenAlexW3099951041MaRDI QIDQ2661592
Sheldon M. Ross, Sridhar Seshadri
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2020.11.006
Cites Work
- Assortment planning with nested preferences: dynamic programming with distributions as states?
- Single-Period Multiproduct Inventory Models with Substitution
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
- A Markov Chain Approximation to Choice Modeling
- Assortment Optimization Under Variants of the Nested Logit Model
- Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
- Assortment Planning and Inventory Decisions Under a Locational Choice Model
- Inventory Models for Substitutable Products: Optimal Policies and Heuristics
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- A Static Approximation for Dynamic Demand Substitution with Applications in a Competitive Market
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The d-Level Nested Logit Model: Assortment and Price Optimization Problems
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Centralized and Competitive Inventory Models with Demand Substitution
- The Assortment Problem with Probabilistic Demands
- The Competitive Newsboy
- Management of Multi-Item Retail Inventory Systems with Demand Substitution
- On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
- Approximation Algorithms for Dynamic Assortment Optimization Models
- Discrete Optimization Via Marginal Analysis
This page was built for publication: An optimal stocking problem to minimize the expected time to sellout
