A branch-and-cut algorithm for the latent-class logit assortment problem.
Isabel Méndez-DíazJuan José Miranda BrontGustavo J. VulcanoPaula ZabalaPublished in: Discret. Appl. Math. (2014)
Keyphrases
- learning algorithm
- cost function
- detection algorithm
- objective function
- theoretical analysis
- computational cost
- high accuracy
- experimental evaluation
- dynamic programming
- worst case
- expectation maximization
- optimization algorithm
- preprocessing
- times faster
- recognition algorithm
- data sets
- simulated annealing
- significant improvement
- convergence rate
- improved algorithm