A general algorithm for determining all essential solutions and inequalities for any convex polyhedron.
Luis Contesse BPublished in: Ann. Oper. Res. (1994)
Keyphrases
- convex hull
- learning algorithm
- optimal solution
- computational complexity
- computational cost
- benchmark problems
- simulated annealing
- globally optimal
- detection algorithm
- genetic algorithm
- k means
- cost function
- optimal or near optimal
- lower and upper bounds
- objective function
- search algorithm
- search space
- matching algorithm
- special case
- worst case
- dynamic programming
- combinatorial optimization
- optimization algorithm
- convergence rate
- linear programming
- solution quality
- bregman divergences