A branch-and-cut algorithm for the latent class logit assortment problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1237.90259
author: Isabel Méndez-Díaz
author: Juan José Miranda-Bront
author: Paula Zabala
author: Gustavo Vulcano
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6033947
zbMATH Keywords: choice behavior
zbMATH Keywords: multinomial logit
zbMATH Keywords: hyperbolic programming
zbMATH Keywords: integer programming
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.049
OpenAlex ID: W2123821916
cites work: A Column Generation Algorithm for Choice-Based Network Revenue Management
cites work: Q5462193
cites work: A note on a global approach for general 0-1 fractional programming
DOI: 10.1016/J.ENDM.2010.05.049
title: A branch-and-cut algorithm for the latent class logit assortment problem
description: scientific article; zbMATH DE number 6033947