A branch-and-cut algorithm for the maximum covering cycle problem.
Eduardo Álvarez-MirandaMarkus SinnlPublished in: Ann. Oper. Res. (2020)
Keyphrases
- preprocessing
- significant improvement
- times faster
- computational cost
- k means
- theoretical analysis
- classification algorithm
- experimental study
- learning algorithm
- dynamic programming
- selection algorithm
- improved algorithm
- neural network
- detection algorithm
- optimization algorithm
- segmentation algorithm
- single pass
- experimental evaluation
- face recognition
- state space
- worst case
- high accuracy
- expectation maximization
- computationally efficient
- np hard
- hidden markov models
- cost function
- data streams
- optimal solution
- objective function
- recognition algorithm
- similarity measure
- machine learning