Pages that link to "Item:Q2806071"
From MaRDI portal
The following pages link to Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (Q2806071):
Displaying 31 items.
- A classification of the literature on the planning of substitutable products (Q319847) (← links)
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution (Q322508) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- A review of choice-based revenue management: theory and methods (Q724103) (← links)
- Metaheuristics for assortment problems with multiple quality levels (Q976046) (← links)
- Retail store operations: literature review and research directions (Q1681258) (← links)
- Inventory management under price-based and stockout-based substitution (Q1683139) (← links)
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- A dynamic programming approach to solving the assortment planning problem with multiple quality levels (Q1762140) (← links)
- An exact method for assortment optimization under the nested logit model (Q2030643) (← links)
- Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution (Q2140151) (← links)
- Which strategy is better for managing multi-product demand uncertainty: inventory substitution or probabilistic selling? (Q2140316) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- In-out algorithm for assortment planning under a ranking-based consumer choice model (Q2183213) (← links)
- Capacitated strategic assortment planning under explicit demand substitution (Q2240061) (← links)
- Assortment planning for multiple chain stores (Q2319385) (← links)
- On the assortment optimization with endogenized market size (Q2661543) (← links)
- An optimal stocking problem to minimize the expected time to sellout (Q2661592) (← links)
- Assortment Planning and Inventory Decisions Under Stockout-Based Substitution (Q3100492) (← links)
- Assortment Planning and Inventory Decisions Under a Locational Choice Model (Q3116004) (← links)
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods (Q3116077) (← links)
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application (Q3392131) (← links)
- Stocking Retail Assortments Under Dynamic Consumer Substitution (Q3635005) (← links)
- Optimal assortment with concave cost functions (Q3690586) (← links)
- Optimal retail assortments for substitutable items purchased in sets (Q4456096) (← links)
- The Multiproduct Newsvendor Problem with Customer Choice (Q4969313) (← links)
- Technical Note—Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets (Q4969332) (← links)
- Technical Note—Multiproduct Inventory Management Under Customer Substitution and Capacity Restrictions (Q4971375) (← links)
- Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences (Q4971565) (← links)
- The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
- Approximation Algorithms for Dynamic Assortment Optimization Models (Q5219727) (← links)
