Optimizing revenue while showing relevant assortments at scale

Theja Tulabandhula, Deeksha Sinha, Saketh Reddy Karra

Abstract: Highlights•Solves the assortment optimization problem under the multinomial logit model.•Proposes scalable algorithms that choose assortments from an arbitrary collection.•Establishes connection between the combinatorial problem and nearest neighbor search.•Provides time-complexity guarantees for general and capacity constrained settings.