Harold S. Stone
- 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.Google Scholar
- 2 --A N D --. A linear programming approach to the cutting-stock problem--Pt. II. Op. Res. 11.6 (May-June 1963), 863-888.Google ScholarDigital Library
- 3 -- AND ---. Multi-stage cutting stock problems of two and more dimensions. Oper. Res. 13:1 (Jan.-Feb. 1965), 94-120.Google ScholarDigital Library
- 4 ---- AND ----. The theory and computation of knapsack functions. Oper. Res. 14, 6 (Nov.- Dec. 1966), 1045-1074.Google Scholar
- 5 HELD, M., AND KAnt, R.M. A dynamic programming approach to sequencing problems. SIAM J. Numer. Anal. 10, 1 (Mar. 1962), 196-210.Google Scholar
- 6 LAWLER, E. L., a~D WOOD, D .E . Branch and bound methods: A survey. Oper. Res. 14, 4 (July-Aug. 1966), 699-719.Google Scholar
- 7 .--. Electrical assemblies with a minimum number of interconnections. IRE Trans. EC-11 (Feb. 1962), 86-88.Google Scholar
- 8 ----, LEVITT, K. N., AND TURNER, J. B. Module clustering to minimize maximum delay in digital networks. IEEE Trans. EC-17 (Feb. 1969).Google Scholar
Index Terms
- An Algorithm for Modular Partitioning
Recommendations
A General Space-filling Curve Algorithm for Partitioning 2D Meshes
HPCC-CSS-ICESS '15: Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conf on Embedded Software and SystemsThis paper describes a recursive algorithm for constructing a generalSpace-Filling Curve (SFC) for an arbitrary distribution of points in2D. We use the SFC to partition 2D meshes, both structured andunstructured, and compare the quality of partitions ...
A Local Refinement Algorithm for Data Partitioning
PARA '00: Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and AcademiaA local refinement method for data partitioning has been constructed. The method balances the workload and minimizes locally the number of edge-cuts. The arithmetic complexity of the algorithm is low. The method is well suited for refinement in ...
Comments