Exact approaches for the unconstrained two-dimensional cutting problem with defects

Cites Work

Unnamed Item
A block-based layer building approach for the 2D guillotine strip packing problem
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
A recursive exact algorithm for weighted two-dimensional cutting
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
Solution procedures for cutting lumber into furniture parts
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
Grids for cutting and packing problems: a study in the 2D knapsack problem
Exact solution techniques for two-dimensional cutting and packing
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
Solving a large cutting problem in the glass manufacturing industry
A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
An open space based heuristic for the 2D strip packing problem with unloading constraints
On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
An improved typology of cutting and packing problems
SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
A simple and effective recursive procedure for the manufacturer's pallet loading problem
An efficient approach for large-scale two-dimensional guillotine cutting stock problems
A Linear Programming Approach to the Cutting-Stock Problem
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
An Algorithm for Two-Dimensional Cutting Problems
Cutting and Packing Problems with Placement Constraints
A new upper bound for unconstrained two-dimensional cutting and packing
An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
The G4-Heuristic for the Pallet Loading Problem
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Two-Dimensional Guillotineable-Layout Cutting Problems with a Single Defect - An AND/OR-Graph Approach
The Theory and Computation of Knapsack Functions
Recursive Computational Procedure for Two-dimensional Stock Cutting
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization