Network flows and non-guillotine cutting patterns

DOI10.1016/0377-2217(84)90075-4zbMath0542.05054OpenAlexW2059699875WikidataQ59561183 ScholiaQ59561183MaRDI QIDQ795062

Endre Boros, Milós Biró

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90075-4

zbMATH Keywords

planar graphsnetwork flowscutting patterns

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial aspects of tessellation and tiling problems (05B45) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Practical adaptations of the Gilmore-Gomory approach to cutting stock problems ⋮ A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems ⋮ An exact algorithm for general, orthogonal, two-dimensional knapsack problems ⋮ Characterization and modelling of guillotine constraints ⋮ Packing problems

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• A comparative study of heuristics for a two-level routing-location problem
• The trim-loss and assortment problems: A survey
• On packing squares with equal squares
• Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
• Matching problems
• The dissection of rectangles into squares
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• Efficient Planarity Testing
• A Solution of the Rectangular Cutting-Stock Problem
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• An Algorithm for Two-Dimensional Cutting Problems
• A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: Network flows and non-guillotine cutting patterns