A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2010.05.049 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2010.05.049 / rank | |||
Normal rank | |||
Latest revision as of 02:52, 20 December 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
