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.039zbMATH Open1188.90181OpenAlexW2044897000MaRDI QIDQ976382FDOQ976382
Authors: Elsa Silva, Filipe Alvelos, José 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
Recommendations
- scientific article; zbMATH DE number 3932795
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Cutting stock problems and solution procedures
- An LP-based approach to a two-stage cutting stock problem
integer programmingcutting2D rectangular SSSCSP with guillotine constraintslength of the cutting operations
Cites Work
- An improved typology of cutting and packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two-dimensional packing problems: a survey
- 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
- 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
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Title not available (Why is that?)
- Models and algorithms for three-stage two-dimensional bin packing
- A New Linear Programming Approach to the Cutting Stock Problem
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Models and bounds for two-dimensional level packing problems
Cited In (40)
- Exact solution techniques for two-dimensional cutting and packing
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Minimum tiling of a rectangle by squares
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- A note on ``Reducing the number of binary variables in cutting stock problems
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- A block-based layer building approach for the 2D guillotine strip packing problem
- Reducing the number of cuts in generating three-staged cutting patterns
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- 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
- Triple-solution approach for the strip packing problem with two-staged patterns
- Models for two-dimensional bin packing problems with customer order spread
- Title not available (Why is that?)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- Heuristics for packing semifluids
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- An efficient deterministic optimization approach for rectangular packing problems
- Exact solution of network flow models with strong relaxations
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
This page was built for publication: An integer programming model for two- and three-stage two-dimensional cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976382)
