The Mixed Disc Packing Problem: Part I: Some Bounds on Density
- 1 March 1983
- journal article
- Published by Taylor & Francis in IIE Transactions
- Vol. 15 (1) , 37-45
- https://doi.org/10.1080/05695558308974611
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock ProblemManagement Science, 1979
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- Optimization and the Geometry of Numbers: Packing and CoveringSIAM Review, 1975
- The Cutting Stock Problem in the Flat Glass IndustryJournal of the Operational Research Society, 1974
- On the Optimal Cutting of Defective SheetsOperations Research, 1968
- On Paving the PlaneThe American Mathematical Monthly, 1968
- A Packing ProblemCanadian Mathematical Bulletin, 1967
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965
- On the Densest Packing of CirclesThe American Mathematical Monthly, 1944