Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.
Ali AouadRetsef LeviDanny SegevPublished in: Oper. Res. (2018)
Keyphrases
- multinomial logit
- learning algorithm
- greedy algorithms
- computational cost
- orders of magnitude
- greedy heuristic
- theoretical analysis
- benchmark datasets
- hill climbing
- planning problems
- partial order
- greedy algorithm
- domain independent
- dynamic environments
- data mining techniques
- optimization problems
- worst case
- significant improvement
- association rules
- computational complexity