A branch-price-and-cut algorithm for the minimum evolution problem.
Daniele CatanzaroRoberto AringhieriMarco Di SummaRaffaele PesentiPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- experimental evaluation
- dynamic programming
- computational cost
- cost function
- high accuracy
- learning algorithm
- detection algorithm
- computational complexity
- k means
- computationally efficient
- expectation maximization
- objective function
- classification algorithm
- improved algorithm
- times faster
- simulated annealing
- data sets
- np hard
- similarity measure
- neural network
- denoising
- probabilistic model
- preprocessing
- theoretical analysis
- optimization algorithm
- optimal solution
- decision trees