Models for the two-dimensional two-stage cutting stock problem with multiple stock size
From MaRDI portal
Publication:336416
DOI10.1016/j.cor.2013.02.026zbMath1348.90487OpenAlexW2049334476WikidataQ57659068 ScholiaQ57659068MaRDI QIDQ336416
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.026
Related Items
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, 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, 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, Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches, Exact solution techniques for two-dimensional cutting and packing, Classification and literature review of integrated lot-sizing and cutting stock problems, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, Deterministic model for customized pilot manufacture production with various backplane sizes, Strip based compact formulation for two-dimensional guillotine cutting problems
Uses Software
Cites Work
- Unnamed Item
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Two-dimensional packing problems: a survey
- LP models for bin packing and cutting stock 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
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- 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
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Multistage Cutting Stock Problems of Two and More Dimensions
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
