"A branch-and-cut algorithm for the latent-class logit assortment problem."

Isabel Méndez-Díaz et al. (2014)

Details and statistics

DOI: 10.1016/J.DAM.2012.03.003

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics