A simulated annealing channel routing algorithm

DOI10.1007/BF02575798zbMath0753.94022MaRDI QIDQ1179437

S. Singh

Publication date: 26 June 1992

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

simulated annealingchannel routingCAD-VLSI

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Circuits, networks (94C99) Enumerative combinatorics (05A99) Theory of computing (68Q99)

Cites Work

• Optimization by Simulated Annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• The time complexity of maximum matching by simulated annealing

This page was built for publication: A simulated annealing channel routing algorithm