Local search for final placement in VLSI design

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2001, Pages 565-572

  Faroe, O ^a   Pisinger, D ^a   Zachariasen, M ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FEEDBACK; HEURISTIC METHODS; ITERATIVE METHODS;

CURRENT LAYOUT ALGORITHMS;

VLSI CIRCUITS;

EID: 0035212535     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. An O-Tree representation of non-slicing floorplan and its applications
2. Macro placement by monte carlo annealing
3. Guided local search for the vehicle routing problem
4. Clustering based simulated annealing for standard cell placement
5. The TimberWolf placement and routing package
6. Efficient and effective placement for very large circuits
7. New algorithms for the placement and routing of macro cells
8. Partial constraint satisfaction problems and guided local search
9. Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
10. Guided local search and its application to the traveling salesman problem
11. Algorithms for large-scale flat placement