A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem.
Isabel Méndez-DíazJuan José Miranda BrontGustavo J. VulcanoPaula ZabalaPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- computational complexity
- cost function
- computationally efficient
- high accuracy
- computational cost
- experimental evaluation
- preprocessing
- objective function
- search space
- k means
- significant improvement
- learning algorithm
- times faster
- dynamic programming
- convergence rate
- probabilistic model
- experimental study
- detection algorithm
- optimization algorithm
- regression analysis
- expectation maximization
- worst case
- similarity measure
- theoretical analysis
- particle swarm optimization
- matching algorithm
- evolutionary algorithm
- optimal solution