Strip based compact formulation for two-dimensional guillotine cutting problems
From MaRDI portal
Publication:2108139
DOI10.1016/j.cor.2022.106044OpenAlexW4302009891MaRDI QIDQ2108139
Silvio Alexandre de Araujo, Carlos Diego Rodrigues, Adriana Cristina Cherri
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106044
Uses Software
Cites Work
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Characterization and modelling of guillotine constraints
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A recursive algorithm for constrained two-dimensional cutting problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- Exact algorithms for the two-dimensional guillotine knapsack
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- Exact solution techniques for two-dimensional cutting and packing
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- An improved typology of cutting and packing problems
- Optimising the cutting of wood fibre plates in the hardboard industry
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A New Linear Programming Approach to the Cutting Stock Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- 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: Strip based compact formulation for two-dimensional guillotine cutting problems
