A branch-and-cut algorithm for the latent-class logit assortment problem
We study the product assortment problem of a retail operation that faces a stream of customers who are heterogeneous with respect to preferences. Each customer belongs to a market segment characterized by a consideration set that includes the alternatives viewed as options, and by the preference wei...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
2012
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 03166caa a22004457a 4500 | ||
|---|---|---|---|
| 001 | PAPER-9713 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518203940.0 | ||
| 008 | 140217s2012 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-84859348212 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 030 | |a DAMAD | ||
| 100 | 1 | |a Méndez-Díaz, I. | |
| 245 | 1 | 2 | |a A branch-and-cut algorithm for the latent-class logit assortment problem |
| 260 | |c 2012 | ||
| 270 | 1 | 0 | |m Zabala, P.; Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentinaemail: pzabala@dc.uba.ar |
| 506 | |2 openaire |e Política editorial | ||
| 520 | 3 | |a We study the product assortment problem of a retail operation that faces a stream of customers who are heterogeneous with respect to preferences. Each customer belongs to a market segment characterized by a consideration set that includes the alternatives viewed as options, and by the preference weights that the segment assigns to each of those alternatives. Upon arrival, he checks the offer set displayed by the firm, and either chooses one of those products or quits without purchasing according to a multinomial-logit (MNL) criterion. The firm's goal is to maximize the expected revenue extracted during a fixed time horizon. This problem also arises in the growing area of choice-based, network revenue management, where computational speed is a critical factor for the practical viability of a solution approach. This so-called latent-class, logit assortment problem is known to be NP-Hard. In this paper, we analyze unconstrained and constrained (i.e., with a limited number of products to display) versions of it, and propose a branch-and-cut algorithm that is computationally fast and leads to (nearly) optimal solutions. © 2012 Elsevier B.V. All rights reserved. |l eng | |
| 536 | |a Article in Press | ||
| 593 | |a Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina | ||
| 593 | |a Leonard N. Stern School of Business, New York University, New York, NY, USA | ||
| 593 | |a Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina | ||
| 690 | 1 | 0 | |a CHOICE BEHAVIOR |
| 690 | 1 | 0 | |a FRACTIONAL PROGRAMMING |
| 690 | 1 | 0 | |a INTEGER PROGRAMMING |
| 690 | 1 | 0 | |a MULTINOMIAL LOGIT |
| 690 | 1 | 0 | |a RETAIL OPERATIONS |
| 690 | 1 | 0 | |a REVENUE MANAGEMENT |
| 700 | 1 | |a Miranda-Bront, J.J. | |
| 700 | 1 | |a Vulcano, G. | |
| 700 | 1 | |a Zabala, P. | |
| 773 | 0 | |d 2012 |p Discrete Appl Math |x 0166218X |w (AR-BaUEN)CENRE-310 |t Discrete Applied Mathematics | |
| 856 | 4 | 1 | |u http://www.scopus.com/inward/record.url?eid=2-s2.0-84859348212&partnerID=40&md5=3407c42073e7fe334d75a4310424b586 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.dam.2012.03.003 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_0166218X_v_n_p_MendezDiaz |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v_n_p_MendezDiaz |y Registro en la Biblioteca Digital |
| 961 | |a paper_0166218X_v_n_p_MendezDiaz |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 963 | |a VARI | ||
| 999 | |c 70666 | ||