This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
April 1977 (vol. 26 no. 4)
pp. 321-328
M.R. Garey, Bell Laboratories
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.
Index Terms:
Circuit card libraries, cost minimization, design automation, dynamic programming, partitioning algorithms.
Citation:
M.R. Garey, F.K. Hwang, D.S. Johnson, "Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units," IEEE Transactions on Computers, vol. 26, no. 4, pp. 321-328, April 1977, doi:10.1109/TC.1977.1674841
Usage of this product signifies your acceptance of the Terms of Use.