A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Column Generation Algorithm for Choice-Based Network Revenue Management / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5462193 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on a global approach for general 0-1 fractional programming / rank | |||
Normal rank | |||
Revision as of 04:24, 5 July 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
