The Mixed Disc Packing Problem: Part I: Some Bounds on Density

References

• Adamowicz , M. and Albano , A. ;, “ A Solution of the Rectangular Cutting-stock Problem ,” IEEE Transactions on System, Management, Cybernetics SMC 6 , 6 , 302 – 310 ( 1976 ).
   Web of Science ®Google Scholar
• Christofides , N. and Whitlock , C , “ An Algorithm for the Two Dimensional Cutting Problem ,” Operations Research 25 , 1 , 30 – 44 ( 1977 ).
   Web of Science ®Google Scholar
• Dyson , R. G. and Gregory , A. S. , “ The Cutting Stock Problems in the Flat Glass Industry ,” Operations Research 22 , 1 , 41 – 53 ( 1974 ).
   Google Scholar
• Fejes Tdfh , L. , Regular Figures , The Macmillan Co. ( 1964 ) .
   Google Scholar
• Florian , August , “ Ausfulling Der Ebene Duroch Kreise ,” Rend. Circ. Mat. Palermol , 300 , 312 ( 1960 ).
   Google Scholar
• Gilmore , P. C. and Gomory , R . “ Multistage Cutting Stock Problems of Two or More Dimensions ,” Operations Research 13 , 94 – 120 ( 1965 )
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. , “ The Theory and Computation of Knapsack Functions ,” Operations Research 14 , 1045 – 1074 ( 1966 ).
   Web of Science ®Google Scholar
• Hahn , S. G . “ On the Optimal Cutting of Defective Sheets ,” Operations Research 16 , 6 , 1100 – 1114 ( 1968 ).
   Web of Science ®Google Scholar
• Haims , M. J. and Freeman , H. , “ A Multistage Solution of the Template-Layout Problem ,” IEEE Transactions on Systems Science and Cybernetics. SSC-6 , 2 , 145 – 151 ( 1970 ).
   Web of Science ®Google Scholar
• Herz , J. C , “ Recursive Computational Procedure for Two-dimensional Stock Cutting ,” IBM Journal of Research and Development 16 , 5 , 462 – 469 ( 1972 ).
   Web of Science ®Google Scholar
• Hilbert , D. and Cohn-Vossen , S . Geometry and Imagination , Chelsea Publishing Co. ( 1952 ) .
   Google Scholar
• Hilbert , D. , Foundations of Geometry , The Open Court Publishing Co ( 1938 ) .
   Google Scholar
• Heesch , H. and Kienzle , O. , Flachenschluss , Springer-Verlag , Berlin-Gottinger , Heidelberg ( 1963 ) .
   Google Scholar
• Kershner , R. , “ On Paving the Plane ,” American Mathematical Monthly 75 , 839 – 844 ( 1968 ).
   Web of Science ®Google Scholar
• Lasdon , L. S. , Optimization Theory for Large Systems , The Macmillan Co. ( 1970 ) .
   Google Scholar
• Melzak , Z. A. , “ Infinite Packing of Disks ,” Canadian Journal of Mathematics 18 , 838 – 852 ( 1966 ).
   Web of Science ®Google Scholar
• Pegels , C. C , “ Heuristic Scheduling Models for Variants of the Two-dimensional Cutting-stock Problem ,” Tappi 50 , 11 , 532 – 535 ( 1967 ).
   Google Scholar
• Saaty , T. L. and Alexander , J. M. , “ Optimization and the Geometry of Numbers: Packing and Covering ,” SIAM Review 17 , 3 ( 1975 ).
   Web of Science ®Google Scholar
• Segre , B. and Mahler , K. , “ On the Densest Packing of Circles ,” American Mathematical Monthly 51 , 261 – 270 ( 1944 ).
   Google Scholar
• Stanton , R. G. , Wiffiams , H. C , and Zarke , C , “ A Packing 1 Problem ,” Canadian Mathematical Bulletin 10 , 287 – 297 ( 1967 ).
   Web of Science ®Google Scholar
• Steudel , H. J. , “ Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem ,” Management Science 25 , 10 , 997 – 1004 ( 1979 ).
   Web of Science ®Google Scholar