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:
| Autores principales: | Méndez-Díaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P. |
|---|---|
| Formato: | INPR |
| Lenguaje: | English |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v_n_p_MendezDiaz |
| Aporte de: |
Ejemplares similares
-
A branch-and-cut algorithm for the latent-class logit assortment problem
por: Méndez-Díaz, I., et al. -
A branch-and-cut algorithm for the latent-class logit assortment problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2012) -
A branch-and-cut algorithm for the latent-class logit assortment problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2014) -
Estimación y pronóstico de demanda de transporte urbano en la ciudad de Villa Carlos Paz, aplicando el modelo logit multinomial mixto
por: Sartori, Juan José Pompilio, et al.
Publicado: (2024) -
A Branch-and-Cut algorithm for graph coloring
por: Méndez Díaz, Isabel, et al.
Publicado: (2006)