Pages that link to "Item:Q2030643"
From MaRDI portal
The following pages link to An exact method for assortment optimization under the nested logit model (Q2030643):
Displaying 17 items.
- An optimization method to estimate models with store-level data: a case study (Q439441) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- Approximately global optimization for assortment problems using piecewise linearization techniques (Q1848593) (← links)
- Assortment optimization using an attraction model in an omnichannel environment (Q2106733) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Assortment optimization under variants of the nested logit model (Q2875595) (← links)
- A branch-and-cut algorithm for the latent class logit assortment problem (Q2883584) (← links)
- Exact and asymptotically exact solutions for a class of assortment problems (Q2901042) (← links)
- A survey of assortment optimization problems under logit-based discrete choice models (Q3176074) (← links)
- The <i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems (Q3453331) (← links)
- Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model (Q5058046) (← links)
- Tractable Approximations for Assortment Planning with Product Costs (Q5126613) (← links)
- Introduction to special issue (Q5918278) (← links)
- A tractable online learning algorithm for the multinomial logit contextual bandit (Q6113379) (← links)
- The follower competitive facility location problem under the nested logit choice rule (Q6168505) (← links)
- Assortment optimization: a systematic literature review (Q6667801) (← links)
