A polynomial oracle-time algorithm for convex integer minimization.
Raymond HemmeckeShmuel OnnRobert WeismantelPublished in: Math. Program. (2011)
Keyphrases
- detection algorithm
- dynamic programming
- computational complexity
- cost function
- k means
- learning algorithm
- globally optimal
- convex hull
- computational cost
- experimental evaluation
- preprocessing
- objective function
- np hard
- optimal solution
- high accuracy
- matching algorithm
- constrained minimization
- evolutionary algorithm
- database
- piecewise linear
- optimization algorithm
- particle swarm optimization
- worst case
- decision trees
- times faster
- clustering algorithm
- convergence rate
- simulated annealing
- geometric interpretation