Characterization and modelling of guillotine constraints
From MaRDI portal
Recommendations
- A polynomial algorithm for one problem of guillotine cutting
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Linear models for 1-group two-dimensional guillotine cutting problems
- An algorithm for the 2D guillotine cutting stock problem
Cites work
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- Modeling of packing problems
- Models and bounds for two-dimensional level packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Network flows and non-guillotine cutting patterns
- Packing problems
- The Theory and Computation of Knapsack Functions
- Two-dimensional packing problems: a survey
Cited in
(20)- Exact solution techniques for two-dimensional cutting and packing
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Heuristics for packing semifluids
- An enumeration scheme to generate constrained exact checkerboard patterns
- A polynomial algorithm for one problem of guillotine cutting
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- Modeling two-dimensional guillotine cutting problems via integer programming
- A block-based layer building approach for the 2D guillotine strip packing problem
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- scientific article; zbMATH DE number 4065050 (Why is no real title available?)
- scientific article; zbMATH DE number 166938 (Why is no real title available?)
- Checkerboard pattern: proposals for its generation
- Linear models for 1-group two-dimensional guillotine cutting problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Keep your distance: land division with separation
- 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
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
This page was built for publication: Characterization and modelling of guillotine constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930945)
