Publication | Closed Access

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

Mathematical ProgrammingEngineeringBranch-and-cut AlgorithmCombinatory AnalysisCombinatorial ProblemComputer ScienceDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationMechanism DesignInteger ProgrammingOperations Research