Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
From MaRDI portal
Publication:930939
DOI10.1016/j.ejor.2007.08.007zbMath1146.90499OpenAlexW2159376627MaRDI QIDQ930939
G. F. Cintra, Flávio K. Miyazawa, Yoshiko Wakabayashi, Eduardo Candido Xavier
Publication date: 24 June 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.08.007
dynamic programmingcolumn generationstrip packingtwo-dimensional packingcutting stockguillotine cutting
Related Items (42)
2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems ⋮ Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ 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 ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ Arc-flow model for the two-dimensional guillotine cutting stock problem ⋮ An exact method for the 2D guillotine strip packing problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Cutting and Packing Problems with Placement Constraints ⋮ A heuristic for the problem of one-dimensional steel coil cutting ⋮ O problema de corte de estoque em indústrias de móveis de pequeno e médio portes ⋮ Improved state space relaxation for constrained two-dimensional guillotine cutting problems ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns ⋮ Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ Order and static stability into the strip packing problem ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ New lower bounds for bin packing problems with conflicts ⋮ An integer programming model for two- and three-stage two-dimensional cutting stock problems ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Strips minimization in two-dimensional cutting stock of circular items ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An and-or-graph approach for two-dimensional cutting problems
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Exact algorithms for the guillotine strip cutting/packing problem.
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- The two-dimensional cutting stock problem revisited
- The rectangular packing problem: local optimum search methods based on block structures
- 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
- Models and bounds for two-dimensional level packing problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- A note on the approximability of cutting stock problems
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- An Exact Approach to the Strip-Packing Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- New results on the average behavior of simplex algorithms
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- On strip packing With rotations
- 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 algorithm for two-dimensional packing
- On Packing Two-Dimensional Bins
- An Algorithm for Two-Dimensional Cutting Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Mathematical Foundations of Computer Science 2003
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- LATIN 2004: Theoretical Informatics
This page was built for publication: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
