2000 character limit reached
A combinatorial algorithm for constrained assortment optimization under nested logit model (1603.09014v1)
Published 30 Mar 2016 in math.OC
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 $O(mn2)$ assortments and show that at least one optimal assortment is included in this set. Based on this observation, a fast algorithm, which runs in $O(m n2 \log mn)$ time, is proposed to find an optimal assortment.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
