A combinatorial algorithm for constrained assortment optimization under nested logit model

arXiv1603.09014MaRDI QIDQ6271998FDOQ6271998

Authors: Tian Xie 

Publication date: 29 March 2016

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(m{n}^2)$ 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{n}^{2}logmn)$ time, is proposed to find an optimal assortment.

This page was built for publication: A combinatorial algorithm for constrained assortment optimization under nested logit model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6271998)