An integer programming model for two- and three-stage two-dimensional cutting stock problems
From MaRDI portal
Publication:976382
DOI10.1016/j.ejor.2010.01.039zbMath1188.90181OpenAlexW2044897000MaRDI QIDQ976382
Elsa Silva, Filipe Alvelos, José M. Valério de Carvalho
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.039
integer programmingcutting2D rectangular SSSCSP with guillotine constraintslength of the cutting operations
Related Items
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production ⋮ An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ 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 ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Exact solution of network flow models with strong relaxations ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ The Meet-in-the-Middle Principle for Cutting and Packing Problems ⋮ Minimum tiling of a rectangle by squares ⋮ HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock 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 ⋮ Heuristics for packing semifluids ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ 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 ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Cites Work
- Unnamed Item
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
This page was built for publication: An integer programming model for two- and three-stage two-dimensional cutting stock problems
