Enhanced formulation for the Guillotine 2D Cutting knapsack problem
From MaRDI portal
Publication:2099494
Recommendations
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Exact algorithms for the two-dimensional guillotine knapsack
Cites work
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A branch and bound algorithm for the strip packing problem
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Characterization and modelling of guillotine constraints
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Exact solution techniques for two-dimensional cutting and packing
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Julia
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Optimising the cutting of wood fibre plates in the hardboard industry
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Solving a large cutting problem in the glass manufacturing industry
- The G4-Heuristic for the Pallet Loading Problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(8)- GuillotineModels.jl
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- scientific article; zbMATH DE number 444958 (Why is no real title available?)
- Enhanced Formulation for Guillotine 2D Cutting Problems
- 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
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
This page was built for publication: Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099494)
