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 8 items.
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- Assortment optimization over time (Q1785447) (← links)
- Product line optimization with multiples sites (Q2676378) (← links)
- Assortment optimization under variants of the nested logit model (Q2875595) (← links)
- Exact and asymptotically exact solutions for a class of assortment problems (Q2901042) (← 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)