Pages that link to "Item:Q2883584"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584):
Displaying 5 items.
- Assortment optimization over time (Q1785447) (← links)
- Assortment Optimization Under Variants of the Nested Logit Model (Q2875595) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
- An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals (Q5130511) (← links)
