A survey of assortment optimization problems under logit-based discrete choice models

DOI10.15960/J.CNKI.ISSN.1007-6093.2017.04.008zbMATH Open1399.90219MaRDI QIDQ3176074FDOQ3176074

Hai Jiang, Rui Chen

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

zbMATH Keywords

assortment optimizationrevenue managementmultinomial logitnested logit

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonlinear programming (90C30)

Cited In (1)

• Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information

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)