On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns

DOI10.1007/s10288-014-0274-3zbMath1345.90080OpenAlexW2058691977MaRDI QIDQ2351163

Yoshiko Wakabayashi, Thiago Alves de Queiroz, Flávio K. Miyazawa

Publication date: 23 June 2015

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-014-0274-3

zbMATH Keywords

combinatorial problemscutting\(L\)-patternnon-guillotine cutraster pointtwo-dimensional unconstrained knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Operations research, economics (aspects of mathematics education) (97M40)

Related Items (3)

Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• An approximation scheme for the two-stage, two-dimensional knapsack problem
• There is no EPTAS for two-dimensional knapsack
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• On the two-dimensional knapsack problem
• Exact algorithms for the two-dimensional guillotine knapsack
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• A branch-and-cut algorithm for the pallet loading problem
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
• The G4-Heuristic for the Pallet Loading Problem
• An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns