Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout

DOI10.1080/00207729108910808zbMath0737.60100OpenAlexW1989261305MaRDI QIDQ3986085

Yasuo Sugai, Hironori Hirata

Publication date: 27 June 1992

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729108910808

zbMATH Keywords

hierarchical simulated annealingreduction of computational time

Mathematics Subject Classification ID

Special processes (60K99) Numerical methods in optimal control (49M99)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Optimization by Simulated Annealing
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm

This page was built for publication: Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout