A branch-and-cut algorithm for the latent class logit assortment problem (Q2883584)
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 6033947
| 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 6033947 |
Statements
13 May 2012
0 references
choice behavior
0 references
multinomial logit
0 references
hyperbolic programming
0 references
integer programming
0 references
A branch-and-cut algorithm for the latent class logit assortment problem (English)
0 references
0.968506634235382
0 references
0.8365641832351685
0 references
0.8337454795837402
0 references
0.8184575438499451
0 references
0.8148912787437439
0 references
