A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:31, 3 February 2024
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
13 May 2012
0 references
choice behavior
0 references
multinomial logit
0 references
hyperbolic programming
0 references
integer programming
0 references
