Arc-flow model for the two-dimensional guillotine cutting stock problem
From MaRDI portal
Publication:2654387
DOI10.1016/j.cor.2009.08.005zbMath1178.90292OpenAlexW2022238601MaRDI QIDQ2654387
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho
Publication date: 15 January 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.08.005
integer programmingcombinatorial optimizationtwo-dimensional cutting stock problemfurniture industryguillotine constraints
Related Items (32)
Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ 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 ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ 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 ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints ⋮ 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 ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ Heuristics for packing semifluids ⋮ 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 ⋮ Improved flow-based formulations for the skiving stock problem ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Cites Work
- Unnamed Item
- Recent advances on two-dimensional bin packing problems
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Packing problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- The Three-Dimensional Bin Packing Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- New classes of fast lower bounds for bin packing problems
This page was built for publication: Arc-flow model for the two-dimensional guillotine cutting stock problem
