Article ID Journal Published Year Pages File Type
10523933 Operations Research Letters 2014 6 Pages PDF
Abstract
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A greedy algorithm for the two-level nested logit model
Authors
, ,