Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry

Recommendations

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
A note on ``Reducing the number of binary variables in cutting stock problems
Mathematical models for the cutting stock with limited open stacks problem
Two-dimensional cutting stock problem under low demand: a study case

Cites work

A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
A global optimization algorithm for the three-dimensional packing problem
A hybrid heuristic to reduce the number of different patterns in cutting stock problems
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
A typology of cutting and packing problems
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
An application of simulated annealing to the cutting stock problem
An improved typology of cutting and packing problems
An integer programming model for two- and three-stage two-dimensional cutting stock problems
Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
Arc-flow model for the two-dimensional guillotine cutting stock problem
Benchmarking optimization software with performance profiles.
Bin packing and cutting stock problems: mathematical models and exact algorithms
BPPLIB: a library for bin packing and cutting stock problems
C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
Exact solution techniques for two-dimensional cutting and packing
Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
scientific article; zbMATH DE number 44282 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 710068 (Why is no real title available?)
scientific article; zbMATH DE number 1175962 (Why is no real title available?)
scientific article; zbMATH DE number 2160609 (Why is no real title available?)
Integer linear programming models for 2-staged two-dimensional knapsack problems
Logic based Benders' decomposition for orthogonal stock cutting problems
Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
Modeling two-dimensional guillotine cutting problems via integer programming
Models and algorithms for three-stage two-dimensional bin packing
Models for the two-dimensional two-stage cutting stock problem with multiple stock size
Multistage Cutting Stock Problems of Two and More Dimensions
New symmetry-less ILP formulation for the classical one dimensional bin-packing problem
One-dimensional cutting stock problem to minimize the number of different patterns
Pattern reduction in one-dimensional cutting stock problems
Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
The dissection of rectangles into squares
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Two-dimensional cutting stock problem with sequence dependent setup times
Two-dimensional Cutting Stock with Multiple Stock Sizes
Two-dimensional packing problems: a survey
Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Cited in

(5)

Models for two-dimensional bin packing problems with customer order spread
Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
Two-dimensional cutting stock problem with flexible length and usable leftovers in the steel industry
Mathematical optimisation in the honeycomb cardboard industry: a model for the two-dimensional variable-sized cutting stock problem
Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing

This page was built for publication: Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106482)