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: | Méndez-Díaz, I. |
|---|---|
| Otros Autores: | Miranda-Bront, J.J, Vulcano, G., Zabala, P. |
| 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í |
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, 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) -
A Branch-and-Cut algorithm for graph coloring
por: Méndez-Díaz, I., et al.
Publicado: (2006)