A survey of assortment optimization problems under logit-based discrete choice models
From MaRDI portal
Publication:3176074
DOI10.15960/J.CNKI.ISSN.1007-6093.2017.04.008zbMATH Open1399.90219MaRDI QIDQ3176074FDOQ3176074
Publication date: 18 July 2018
Recommendations
- Assortment optimization under variants of the nested logit model
- Capacitated assortment and price optimization under the multinomial logit model
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- A branch-and-cut algorithm for the latent-class logit assortment problem
- An exact method for assortment optimization under the nested logit model
Cited In (22)
- Mallows-smoothed distribution over rankings approach for modeling choice
- Assortment optimization under a multinomial logit model with position bias and social influence
- Assortment optimization under the sequential multinomial logit model
- Assortment optimization under the multinomial logit model with utility-based rank cutoffs
- An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Technical note -- The multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays
- Robust assortment optimization using worst-case CVaR under the multinomial logit model
- Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
- On the linear integration of attraction choice models in business optimization problems
- Joint promotional effort and assortment optimization under the multinomial logit model
- Constrained multi‐location assortment optimization under the multinomial logit model
- Assortment optimization under variants of the nested logit model
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A branch-and-cut algorithm for the latent class logit assortment problem
- Assortment optimization with position effects under the nested logit model
- Assortment planning for vertically differentiated products under a consider-then-choose model
- Robust assortment optimization in revenue management under the multinomial logit choice model
- Optimizing revenue while showing relevant assortments at scale
- Capacitated assortment and price optimization under the multinomial logit model
This page was built for publication: A survey of assortment optimization problems under logit-based discrete choice models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176074)
