Recursive Computational Procedure for Two-dimensional Stock Cutting
From MaRDI portal
Publication:5681831
DOI10.1147/rd.165.0462zbMath0265.90057OpenAlexW2060525068MaRDI QIDQ5681831
Publication date: 1972
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.165.0462
Related Items
Solution procedures for cutting lumber into furniture parts, Determining an upper bound for a class of rectangular packing problems, On the effectivity of gradient methods for cutting stock problems, Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, An improved typology of cutting and packing problems, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, An integrated cutting stock and sequencing problem, Optimising the cutting of wood fibre plates in the hardboard industry, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, The computer as an aid to physical distribution management, Combinatorial Benders' Cuts for the Strip Packing Problem, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, Exact solutions for constrained two-dimensional cutting problems, An analytical model for the container loading problem, Bun splitting: a practical cutting stock problem, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, An introduction to the two‐dimensional rectangular cutting and packing problem, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, Exact approaches for the unconstrained two-dimensional cutting problem with defects, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, A new search procedure for the two-dimensional orthogonal packing problem, The static stability of support factor‐based rectangular packings: an assessment by regression analysis, The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids, The trim-loss and assortment problems: A survey, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, The cutting stock problem in a hardboard industry: A case study., A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems., Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, Cutting and Packing Problems with Placement Constraints, Exploiting Packing Components in General-Purpose Integer Programming Solvers, Two-dimensional knapsack-block packing problem, An and-or-graph approach for two-dimensional cutting problems, Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Simple block patterns for the two-dimensional cutting problem, Knowledge based approach to the cutting stock problem, Packing problems, A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems, Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing, A branch-and-cut algorithm for the pallet loading problem, Grids for cutting and packing problems: a study in the 2D knapsack problem, The pallet packing problem for non-uniform box sizes, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, Exact solution techniques for two-dimensional cutting and packing, Computing stable loads for pallets, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, The pallet loading problem: a review of solution methods and computational experiments, SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects, A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application, The exact solutions of several types of container loading problems, A recursive exact algorithm for weighted two-dimensional cutting, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem, The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, An efficient approach for the multi-pallet loading problem, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, 4-block heuristic for the rectangle packing problem, Improved flow-based formulations for the skiving stock problem, Solving container loading problems by block arrangement, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, Network flows and non-guillotine cutting patterns, Enhanced formulation for the Guillotine 2D Cutting knapsack problem, Generating optimal two-section cutting patterns for rectangular blanks, Strip based compact formulation for two-dimensional guillotine cutting problems, On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
