Enhanced formulation for the Guillotine 2D Cutting knapsack problem
From MaRDI portal
Publication:2099494
DOI10.1007/s12532-022-00222-4OpenAlexW4285089896MaRDI QIDQ2099494
Henrique Becker, Luciana S. Buriol, Olinto Araújo
Publication date: 24 November 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06348
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Julia
- Characterization and modelling of guillotine constraints
- A branch and bound algorithm for the strip packing problem
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Exact solution techniques for two-dimensional cutting and packing
- Solving a large cutting problem in the glass manufacturing industry
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Optimising the cutting of wood fibre plates in the hardboard industry
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- Julia: A Fresh Approach to Numerical Computing
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- The G4-Heuristic for the Pallet Loading Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- JuMP: A Modeling Language for Mathematical Optimization
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
This page was built for publication: Enhanced formulation for the Guillotine 2D Cutting knapsack problem
