Exact approaches for the unconstrained two-dimensional cutting problem with defects
From MaRDI portal
Recommendations
- Exact solutions for constrained two-dimensional cutting problems
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Exact solution techniques for two-dimensional cutting and packing
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Exact approaches for the cutting path determination problem
- Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach
- An approach to two-dimensional cutting stock problems
- A recursive algorithm for constrained two-dimensional cutting problems
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
Cites work
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- A Linear Programming Approach to the Cutting-Stock Problem
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- A new upper bound for unconstrained two-dimensional cutting and packing
- A recursive exact algorithm for weighted two-dimensional cutting
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- An Algorithm for Two-Dimensional Cutting Problems
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- An improved typology of cutting and packing problems
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Cutting and packing problems with placement constraints
- Exact solution techniques for two-dimensional cutting and packing
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- Solution procedures for cutting lumber into furniture parts
- Solving a large cutting problem in the glass manufacturing industry
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- The G4-Heuristic for the Pallet Loading Problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- The Theory and Computation of Knapsack Functions
- Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach
- Using GPU computing for solving the two-dimensional guillotine cutting problem
Cited in
(4)- Exact solutions for constrained two-dimensional cutting problems
- Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment
- Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
This page was built for publication: Exact approaches for the unconstrained two-dimensional cutting problem with defects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068735)
