The Community for Technology Leaders
Green Image
We consider an abstract partitioning problem which has applications to the design of standard libraries of multipurpose units (such as multi-purpose circuit cards) and to storage allocation in the presence of users with conflicting demands. Although the general problem of finding minimum cost partitions appears to be very difficult, we describe a dynamic programming approach which can be quite efficient if the parameters for the items to be partitioned take on only a limited number of distinct values.
Circuit card libraries, cost minimization, design automation, dynamic programming, partitioning algorithms.

D. Johnson, F. Hwang and M. Garey, "Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units," in IEEE Transactions on Computers, vol. 26, no. , pp. 321-328, 1977.
92 ms
(Ver 3.3 (11022016))