Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem.
Luidi SimonettiAlexandre Salles da CunhaAbilio LucenaPublished in: Math. Program. (2013)
Keyphrases
- tree structure
- experimental evaluation
- learning algorithm
- cost function
- improved algorithm
- detection algorithm
- times faster
- computational cost
- high accuracy
- theoretical analysis
- preprocessing
- dynamic programming
- computationally efficient
- significant improvement
- optimization algorithm
- recognition algorithm
- ant colony optimization
- linear programming
- convex hull
- convergence rate
- minimum spanning tree
- clustering method
- input data
- simulated annealing
- computational complexity
- data structure
- objective function
- similarity measure
- decision trees