Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.creator | Méndez-Díaz, Isabel | - |
| dc.creator | Miranda Bront, Juan Jose | - |
| dc.creator | Vulcano, Gustavo | - |
| dc.creator | Zabala, Paula Lorena | - |
| dc.date | 2019-01-16T20:37:35Z | - |
| dc.date | 2019-01-16T20:37:35Z | - |
| dc.date | 2012-03 | - |
| dc.date | 2019-01-16T18:28:36Z | - |
| dc.date.accessioned | 2019-04-29T15:57:32Z | - |
| dc.date.available | 2019-04-29T15:57:32Z | - |
| dc.identifier | Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Vulcano, Gustavo; Zabala, Paula Lorena; A branch-and-cut algorithm for the latent-class logit assortment problem; Elsevier Science; Discrete Applied Mathematics; 164; PART 1; 3-2012; 246-263 | - |
| dc.identifier | 0166-218X | - |
| dc.identifier | http://hdl.handle.net/11336/68177 | - |
| dc.identifier | CONICET Digital | - |
| dc.identifier | CONICET | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/306235 | - |
| dc.description | 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. | - |
| dc.description | Fil: Méndez-Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.description | Fil: Miranda Bront, Juan Jose. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.description | Fil: Vulcano, Gustavo. Leonard N. Stern School of Business; Estados Unidos. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.description | Fil: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Elsevier Science | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.dam.2012.03.003 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X12001072 | - |
| dc.rights | info:eu-repo/semantics/restrictedAccess | - |
| dc.rights | https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ | - |
| dc.source | reponame:CONICET Digital (CONICET) | - |
| dc.source | instname:Consejo Nacional de Investigaciones Científicas y Técnicas | - |
| dc.source | instacron:CONICET | - |
| dc.subject | CHOICE BEHAVIOR | - |
| dc.subject | FRACTIONAL PROGRAMMING | - |
| dc.subject | INTEGER PROGRAMMING | - |
| dc.subject | MULTINOMIAL LOGIT | - |
| dc.subject | RETAIL OPERATIONS | - |
| dc.subject | REVENUE MANAGEMENT | - |
| dc.subject | Ciencias de la Computación | - |
| dc.subject | Ciencias de la Computación e Información | - |
| dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
| dc.title | A branch-and-cut algorithm for the latent-class logit assortment problem | - |
| dc.type | info:eu-repo/semantics/article | - |
| dc.type | info:eu-repo/semantics/publishedVersion | - |
| dc.type | info:ar-repo/semantics/articulo | - |
| Aparece en las colecciones: | CONICET | |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.