Heuristic for constrained T-shape cutting patterns of rectangular pieces
From MaRDI portal
(Redirected from Publication:339642)
Recommendations
- Fast heuristic for constrained homogenous T-shape cutting patterns
- T-shape homogeneous block patterns for the two-dimensional cutting problem
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Simple block patterns for the two-dimensional cutting problem
Cites work
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Algorithms for the constrained two-staged two-dimensional cutting problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- An exact algorithm for generating homogeneous T-shape cutting patterns
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Cutting stock problems and solution procedures
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-stage general block patterns for the two-dimensional cutting problem
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
Cited in
(9)- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- A block-based layer building approach for the 2D guillotine strip packing problem
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- Fast heuristic for constrained homogenous T-shape cutting patterns
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- T-shape homogeneous block patterns for the two-dimensional cutting problem
This page was built for publication: Heuristic for constrained T-shape cutting patterns of rectangular pieces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339642)
