A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2010.05.049 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2123821916 / rank | |||
Normal rank | |||
Revision as of 18:50, 19 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
