On upper bounds for assortment optimization under the mixture of multinomial logit models
From MaRDI portal
Publication:1785635
DOI10.1016/J.ORL.2015.01.010zbMATH Open1408.62193OpenAlexW1967402052MaRDI QIDQ1785635FDOQ1785635
Authors: Sumit Kunnumkal 
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://eprints.exchange.isb.edu/382/1/mixedLogit_bounds.pdf
Recommendations
- Assortment optimization under variants of the nested logit model
- Assortment optimization under the paired combinatorial logit model
- Tractable approximations for assortment planning with product costs
- Capacitated assortment and price optimization under the multinomial logit model
- Technical note -- Capacitated assortment optimization: hardness and approximation
Cites Work
- A column generation algorithm for choice-based network revenue management
- New formulations for choice network revenue management
- Robust assortment optimization in revenue management under the multinomial logit choice model
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
Cited In (7)
- Tractable approximations for assortment planning with product costs
- Robust assortment optimization using worst-case CVaR under the multinomial logit model
- Robust assortment optimization under sequential product unavailability
- Fractional 0-1 programming and submodularity
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models
- Assortment optimization: a systematic literature review
This page was built for publication: On upper bounds for assortment optimization under the mixture of multinomial logit models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785635)
