Network flows and non-guillotine cutting patterns

This publication has 19 references indexed in Scilit:

• Scheduling subject to resource constraints: classification and complexity
  Discrete Applied Mathematics, 1983
• A 54 algorithm for two-dimensional packing
  Journal of Algorithms, 1981
• The trim-loss and assortment problems: A survey
  European Journal of Operational Research, 1980
• A heuristic solution of the rectangular cutting stock problem
  The Computer Journal, 1980
• Packing the maximum number of m × n tiles in a large p × q rectangle
  Discrete Mathematics, 1979
• A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
  Journal of the Operational Research Society, 1978
• On packing squares with equal squares
  Journal of Combinatorial Theory, Series A, 1975
• Efficient Planarity Testing
  Journal of the ACM, 1974
• Project Scheduling under Resource Constraints—Historical Review and Categorization of Procedures
  A I I E Transactions, 1973
• The dissection of rectangles into squares
  Duke Mathematical Journal, 1940