Computational results on an algorithm for finding all vertices of a polytope.
T. H. MattheissBrian K. SchmidtPublished in: Math. Program. (1980)
Keyphrases
- preprocessing
- computational complexity
- experimental evaluation
- hamiltonian cycle
- segmentation algorithm
- search space
- k means
- detection algorithm
- dynamic programming
- objective function
- recognition algorithm
- convex hull
- cost function
- similarity measure
- convergence rate
- times faster
- computational cost
- significant improvement
- optimal solution
- learning algorithm
- probabilistic model
- worst case
- high accuracy
- optimization algorithm
- np hard
- clustering method
- association rules
- traveling salesman problem
- search algorithm
- knapsack problem
- graph structure
- method finds