A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Markus BehleMichael JüngerFrauke LiersPublished in: WEA (2007)
Keyphrases
- dynamic programming
- objective function
- times faster
- computational cost
- computational complexity
- significant improvement
- learning algorithm
- improved algorithm
- experimental evaluation
- recognition algorithm
- matching algorithm
- optimization algorithm
- preprocessing
- expectation maximization
- high accuracy
- k means
- detection algorithm
- input data
- cost function
- lower bound
- search space
- simulated annealing
- linear programming
- similarity measure
- particle swarm optimization
- optimal solution
- np hard
- tree structure
- path planning
- clustering algorithm
- genetic algorithm
- primal dual