A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-cut algorithm for the latent-class logit assortment problem |
scientific article; zbMATH DE number 6484198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the latent-class logit assortment problem |
scientific article; zbMATH DE number 6484198 |
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
0.968506634235382
0 references
0.8442173004150391
0 references
0.8372811675071716
0 references
0.8321613669395447
0 references
0.827214241027832
0 references
