Old and new multiscale approaches for global optimization are
briefly reviewed. They include new and general algebraic
multigrid methods, and several techniques of multilevel
annealing. These general approaches suggest various possible
procedures for the problems of partition, clustering, VLSI
placement and routing.