A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:55, 5 March 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
