Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Journal of the ACM (JACM)
On Approximation Methods for the Assignment Problem
Journal of the ACM (JACM)
Optimizing bit-time computer simulation
Communications of the ACM
The complexity of design automation problems
DAC '80 Proceedings of the 17th Design Automation Conference
Automated placement of multi-terminal components
DAC '71 Proceedings of the 8th Design Automation Workshop
Modular Replacement of Combinational Switching Networls
IEEE Transactions on Computers
| Hi-index | 0.00 |
Most of the problems encountered in the area of the design automation of computers are combinatorial. One procedure which is sometimes very effective for solving combinatorial problems is to formulate them as discrete linear programming problems. The integer programming formulation of the following problems can be found in the literature.