Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem.
Alexandre Salles da CunhaLuidi SimonettiAbilio LucenaPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- k means
- learning algorithm
- times faster
- computational complexity
- simulated annealing
- worst case
- dynamic programming
- experimental evaluation
- computational cost
- objective function
- matching algorithm
- high accuracy
- cost function
- expectation maximization
- theoretical analysis
- segmentation algorithm
- preprocessing
- optimal solution
- improved algorithm
- estimation algorithm
- np hard
- significant improvement
- detection algorithm
- classification algorithm
- recognition algorithm
- exhaustive search