Pages that link to "Item:Q4971565"
From MaRDI portal
The following pages link to Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences (Q4971565):
Displaying 9 items.
- Capacitated assortment and price optimization under the nested logit model (Q785637) (← links)
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution (Q2140151) (← links)
- In-out algorithm for assortment planning under a ranking-based consumer choice model (Q2183213) (← links)
- Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (Q2806071) (← links)
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
- Two-stage pricing of products and services considering different competitive environments (Q6659831) (← links)
- Assortment optimization: a systematic literature review (Q6667801) (← links)