Simulated annealing: a fast heuristic for some generic layout problems

This publication has 8 references indexed in Scilit:

• Performance of a new annealing schedule
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
  Operations Research, 1989
• Simulated Annealing Without Rejected Moves
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
• A Procedure for Placement of Standard-Cell VLSI Circuits
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
• A Linear-Time Heuristic for Improving Network Partitions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  Mathematics of Operations Research, 1977
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
  Operations Research, 1973
• The shortest path through many points
  Mathematical Proceedings of the Cambridge Philosophical Society, 1959