An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
From MaRDI portal
Publication:2675700
Recommendations
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Modeling two-dimensional guillotine cutting problems via integer programming
- Characterization and modelling of guillotine constraints
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
Cites work
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- A tree search algorithm for solving the container loading problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An AND/OR-graph approach to the container loading problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An improved typology of cutting and packing problems
- Approximate algorithms for the container loading problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models and algorithms for three-stage two-dimensional bin packing
- Multi-dimensional bin packing problems with guillotine constraints
- Multistage Cutting Stock Problems of Two and More Dimensions
- On the two-dimensional knapsack problem
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- The G4-Heuristic for the Pallet Loading Problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(6)- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- A new dynamic programming procedure for three-staged cutting patterns
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Modeling two-dimensional guillotine cutting problems via integer programming
- Characterization and modelling of guillotine constraints
- Multi-dimensional bin packing problems with guillotine constraints
This page was built for publication: An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675700)
