A branch-and-cut algorithm for the latent class logit assortment problem

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 383-390

  Méndez Díaz, Isabel ^a   Miranda Bront, Juan José ^a   Vulcano, Gustavo ^b   Zabala, Paula ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Choice behavior; Hyperbolic programming; Integer programming; Multinomial logit

Indexed keywords

EID: 77954944615     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.049     Document Type: Article

References (6)

1. G. Gallego, G. Iyengar, R. Phillips, and A. Dubey. Managing flexible products on a network. Technical Report CORC TR-2004-01, Department of Industrial Engineering and Operations Research, Columbia University, 2004.
2. Liu Q., van Ryzin G. On the choice-based linear programming model for network revenue management. MSOM 2008, 10:288-310.
3. Miranda-Bront J., Méndez-Díaz I., Vulcano G. A column generation algorithm for choice-based network revenue management. Operations Research 2009, 57:769-784.
4. Prokopyev O., Meneses C., Oliveira C., Pardalos P. On multiple-ratio hyperbolic 0-1 programming problems. Pacific Journal of Optimization 2005, 1/2:327-345.
5. P. Rusmevichientong, M. Shen, and D. Shmoys. Dynamic assortment optimization with multinomial logit choice model and capacity constraint. Working paper, School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 2009.
6. Wu T. A note on a global approach for general 0-1 fractional programming. European Journal of Operational Research 1997, 101:220-223.