Enhanced second order algorithm applied to the capacitated minimum spanning tree problem.
Pedro MartinsPublished in: Comput. Oper. Res. (2007)
Keyphrases
- computational complexity
- computationally efficient
- improved algorithm
- times faster
- cost function
- experimental evaluation
- optimization algorithm
- significant improvement
- clustering method
- theoretical analysis
- high accuracy
- minimum spanning tree
- selection algorithm
- memory requirements
- matching algorithm
- worst case
- probabilistic model
- dynamic programming
- np hard
- preprocessing
- optimal solution
- objective function
- simulated annealing
- tree structure
- bayesian networks
- data sets