A Polynomial Time Algorithm for Shaped Partition Problems.
Frank K. HwangShmuel OnnUriel G. RothblumPublished in: SIAM J. Optim. (1999)
Keyphrases
- optimization algorithm
- experimental evaluation
- times faster
- preprocessing
- learning algorithm
- np hard
- computational cost
- worst case
- polynomial time complexity
- high accuracy
- energy function
- greedy algorithms
- np hardness
- dynamic programming
- benchmark problems
- convergence rate
- expectation maximization
- test problems
- strongly polynomial
- matching algorithm
- simulated annealing
- probabilistic model
- multi objective
- special case
- k means
- evolutionary algorithm
- optimal solution