A combinatorial algorithm for constrained assortment optimization under nested logit model
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 mn) time, is proposed to find an optimal assortment.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.