ACM Home Page
Please provide us with feedback. Feedback
An Algorithm for Modular Partitioning
Full text PdfPdf (918 KB)
Source Journal of the ACM (JACM) archive
Volume 17 ,  Issue 1  (January 1970) table of contents
Pages: 182 - 195  
Year of Publication: 1970
ISSN:0004-5411
Author
Harold S. Stone  Stanford Research Institute, Menlo Park, California and Stanford University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321556.321573
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GILMORE, P. C., AND GOMORY, R. E. A Linear programming approach to the cuttingstock problem. Oper. Res. 9, 6 (Nov.-1)ec. 1961), 849 859.
 
2
--A N D --. A linear programming approach to the cutting-stock problem--Pt. II. Op. Res. 11.6 (May-June 1963), 863-888.
 
3
-- AND ---. Multi-stage cutting stock problems of two and more dimensions. Oper. Res. 13:1 (Jan.-Feb. 1965), 94-120.
 
4
---- AND ----. The theory and computation of knapsack functions. Oper. Res. 14, 6 (Nov.- Dec. 1966), 1045-1074.
 
5
HELD, M., AND KAnt, R.M. A dynamic programming approach to sequencing problems. SIAM J. Numer. Anal. 10, 1 (Mar. 1962), 196-210.
 
6
LAWLER, E. L., a~D WOOD, D .E . Branch and bound methods: A survey. Oper. Res. 14, 4 (July-Aug. 1966), 699-719.
 
7
.--. Electrical assemblies with a minimum number of interconnections. IRE Trans. EC-11 (Feb. 1962), 86-88.
 
8
----, LEVITT, K. N., AND TURNER, J. B. Module clustering to minimize maximum delay in digital networks. IEEE Trans. EC-17 (Feb. 1969).