A combinatorial algorithm for constrained assortment optimization under nested logit model
Optimization and Control
2016-03-31 v1
Abstract
We consider the assortment optimization problem with disjoint-cardinality constraints under two-level nested logit model. To solve this problem, we first identify a candidate set with assortments and show that at least one optimal assortment is included in this set. Based on this observation, a fast algorithm, which runs in time, is proposed to find an optimal assortment.
Cite
@article{arxiv.1603.09014,
title = {A combinatorial algorithm for constrained assortment optimization under nested logit model},
author = {Tian Xie},
journal= {arXiv preprint arXiv:1603.09014},
year = {2016}
}