A branch-and-cut algorithm for the minimum branch vertices spanning tree problem.
Selene SilvestriGilbert LaporteRaffaele CerulliPublished in: Comput. Oper. Res. (2017)
Keyphrases
- experimental evaluation
- detection algorithm
- preprocessing
- improved algorithm
- learning algorithm
- significant improvement
- high accuracy
- times faster
- k means
- spanning tree
- probabilistic model
- convex hull
- computationally efficient
- worst case
- search space
- linear programming
- convergence rate
- global minimum
- minimum spanning tree
- minimum length
- tree structure
- optimization algorithm
- particle swarm optimization
- simulated annealing
- dynamic programming
- computational complexity
- search algorithm
- objective function