Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
From MaRDI portal
(Redirected from Publication:2806071)
Recommendations
- Approximation algorithms for dynamic assortment optimization models
- Assortment planning and inventory decisions under stockout-based substitution
- Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Assortment planning and inventory decisions under a locational choice model
Cites work
- scientific article; zbMATH DE number 5764859 (Why is no real title available?)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
- A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
- A quasi-PTAS for unsplittable flow on line graphs
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- Assortment planning and inventory decisions under a locational choice model
- Assortment planning and inventory decisions under stockout-based substitution
- Bin packing can be solved within 1+epsilon in linear time
- Centralized and Competitive Inventory Models with Demand Substitution
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Geometric approximation algorithms
- Inventory Models for Substitutable Products: Optimal Policies and Heuristics
- Management of Multi-Item Retail Inventory Systems with Demand Substitution
- On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
- Optimal ordering decisions for two substitutable products with stochastic demands
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- The Assortment Problem with Probabilistic Demands
Cited in
(36)- An optimal stocking problem to minimize the expected time to sellout
- Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
- Assortment planning for multiple chain stores
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Optimizing omnichannel assortments and inventory provisions under the multichannel attraction model
- Metaheuristics for assortment problems with multiple quality levels
- Assortment optimization under the multinomial logit choice model with product-specific capacities
- Assortment planning with nested preferences: dynamic programming with distributions as states?
- Optimal retail assortments for substitutable items purchased in sets
- A review of choice-based revenue management: theory and methods
- A dynamic programming approach to solving the assortment planning problem with multiple quality levels
- The approximability of assortment optimization under ranking preferences
- Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution
- Which strategy is better for managing multi-product demand uncertainty: inventory substitution or probabilistic selling?
- Technical note: Capacitated assortment optimization under the multinomial logit model with nested consideration sets
- A classification of the literature on the planning of substitutable products
- Optimal assortment with concave cost functions
- Pricing and assortment optimization under logit-based choice models with tree-structured consideration sets
- An efficient algorithm for large-scale dynamic assortment planning problems
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution
- The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications
- Robust assortment optimization under sequential product unavailability
- On the assortment optimization with endogenized market size
- Assortment planning and inventory decisions under a locational choice model
- Inventory management under price-based and stockout-based substitution
- An exact method for assortment optimization under the nested logit model
- The multiproduct newsvendor problem with customer choice
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Assortment planning and inventory decisions under stockout-based substitution
- In-out algorithm for assortment planning under a ranking-based consumer choice model
- Dynamic assortment with demand learning for seasonal consumer goods
- Retail store operations: literature review and research directions
- Approximation algorithms for dynamic assortment optimization models
- Technical Note—Multiproduct Inventory Management Under Customer Substitution and Capacity Restrictions
- Capacitated strategic assortment planning under explicit demand substitution
This page was built for publication: Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806071)
