A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the latent-class logit assortment problem |
scientific article |
Statements
A branch-and-cut algorithm for the latent-class logit assortment problem (English)
0 references
22 September 2015
0 references
retail operations
0 references
revenue management
0 references
choice behavior
0 references
multinomial logit
0 references
integer programming
0 references
fractional programming
0 references
0 references
0 references
0 references
