A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem - Concepedia

Concepedia

Publication | Closed Access

A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem

24

Citations

5

References

2010

Year

Isabel Méndez‐Díaz, Juan José Miranda‐Bront, Gustavo Vulcano, Paula Zabala

Electronic Notes in Discrete Mathematics

Mathematical ProgrammingEngineeringBranch-and-cut AlgorithmCombinatory AnalysisCombinatorial ProblemAlgorithmic EfficiencyComputer ScienceDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationCombinatorial MethodMechanism DesignOperations Research

References

	Year	Citations

Page 1