A branch-and-cut algorithm for the latent-class logit assortment problem · Study