On the Use of the Linear Assignment Algorithm in Module Placement
- 1 January 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 137-144
- https://doi.org/10.1109/dac.1981.1585344
Abstract
This paper examines the application of the computationally powerful linear assignment algorithm to the placement problem. A brief description of the algorithm is given, followed by a discussion of its use with various problem constraints, for improving existing placements, and in a constructive-initial placement procedure. Several examples are included.Keywords
This publication has 12 references indexed in Scilit:
- Solving the Assignment Problem by RelaxationOperations Research, 1980
- An Approach to Gate Assignment and Module Placement for Printed Wiring BoardsIEEE Transactions on Computers, 1980
- The interchange algorithms for circuit placement problemsPublished by Association for Computing Machinery (ACM) ,1980
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- A Review of the Placement and Quadratic Assignment ProblemsSIAM Review, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A Heuristic Procedure for the Partitioning and Mapping of Computer Logic GraphsIEEE Transactions on Computers, 1971
- A Primal Method for the Assignment and Transportation ProblemsManagement Science, 1964
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961
- Algorithm 27: assignmentCommunications of the ACM, 1960