A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2010.05.049 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| 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 | |||
| 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
