Assortment optimization over time
From MaRDI portal
Recommendations
- Combinatorial assortment optimization
- Assortment optimization under the paired combinatorial logit model
- Approximation algorithms for dynamic assortment optimization models
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
Cites work
- A branch-and-cut algorithm for the latent class logit assortment problem
- A column generation algorithm for choice-based network revenue management
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions—I
- Approximating min sum set cover
- Assortment optimization under variants of the nested logit model
- Assortment planning and inventory decisions under stockout-based substitution
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Dynamic assortment with demand learning for seasonal consumer goods
- Learning consumer tastes through dynamic assortments
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Stocking Retail Assortments Under Dynamic Consumer Substitution
Cited in
(4)- Approximation algorithms for product framing and pricing
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Technical note -- The multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays
- Optimizing assortment and pricing of multiple retail categories with cross-selling
This page was built for publication: Assortment optimization over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785447)
