On upper bounds for assortment optimization under the mixture of multinomial logit models
type: Item
instance of: scholarly article
title: On upper bounds for assortment optimization under the mixture of multinomial logit models
zbMATH Open document ID: 1408.62193
author: Sumit Kunnumkal
published in: Operations Research Letters
publication date: 2018-10-01T00:00:00Z
full work available at URL: mixedLogit bounds.pdf
Mathematics Subject Classification ID: 62P20
Mathematics Subject Classification ID: 91B42
zbMATH DE Number: 6945721
zbMATH Keywords: assortment optimization
zbMATH Keywords: customer choice
zbMATH Keywords: multinomial logit
zbMATH Keywords: upper bounds
MaRDI profile type: Publication
OpenAlex ID: W1967402052
cites work: A Column Generation Algorithm for Choice-Based Network Revenue Management
cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
cites work: Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
cites work: New Formulations for Choice Network Revenue Management
DOI: 10.1016/J.ORL.2015.01.010
description: scientific article; zbMATH DE number 6945721