Login / Signup
An efficient algorithm for capacitated assortment planning with stochastic demand and substitution.
Alexander H. Hübner
Heinrich Kuhn
Sandro Kühn
Published in:
Eur. J. Oper. Res. (2016)
Keyphrases
</>
learning algorithm
search space
cost function
np hard
convex hull
optimal solution
dynamic programming
machine learning
linear programming
transportation problem
decision making
bayesian networks
linear program
knapsack problem