Login / Signup
Optimal Set-Partitioning Based on Group Quality likelihood using Partition-Growing Algorithm.
Chaivatna Sumetphong
Supachai Tangwongsan
Published in:
Discret. Math. Algorithms Appl. (2013)
Keyphrases
</>
dynamic programming
optimal solution
np hard
worst case
objective function
computational complexity
cost function
simulated annealing
upper bound
particle swarm optimization
expectation maximization
convex hull
minimum cost
lower and upper bounds
set partitioning