Solution of placement and routing problems in telephone exchange unit designs

DOI10.1007/BF01720248MaRDI QIDQ1109671zbMATH OpenFDO

Authors S. H. Smith

Publication date 1988

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01720248

zbMATH Keywords

manufacturingplacement and routing heuristics

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Concurrent placement and routing in the design of integrated circuits
• scientific article; zbMATH DE number 3914249
• Practical Automatic Placement for Standard-Cell Integrated Circuits
• Optimal Placement for River Routing
• Routing heuristics for automated pick and place machines

Cites work

• A Review of the Placement and Quadratic Assignment Problems
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Generation of Permutations by Adjacent Transposition
• Optimization by simulated annealing
• Some Simple Applications of the Travelling Salesman Problem

Cited in

(1)

• Concurrent placement and routing in the design of integrated circuits

This page was built for publication: Solution of placement and routing problems in telephone exchange unit designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109671)