A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance.

Published in: VLSI Design (1996)

Keyphrases

simulated annealing
k means
dynamic programming
optimal solution
objective function
np hard
genetic algorithm
worst case
particle swarm optimization
matching algorithm
solution quality
probabilistic model
global optimum