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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
Bin packing and cutting stock problems: mathematical models and exact algorithms
Models for the two-dimensional two-stage cutting stock problem with multiple stock size
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
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
An integer programming model for two- and three-stage two-dimensional cutting stock problems
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
An application of simulated annealing to the cutting stock problem
Integer linear programming models for 2-staged two-dimensional knapsack problems
A global optimization algorithm for the three-dimensional packing problem
Logic based Benders' decomposition for orthogonal stock cutting problems
Two-dimensional cutting stock problem with sequence dependent setup times
BPPLIB: a library for bin packing and cutting stock problems
A typology of cutting and packing problems
Two-dimensional packing problems: a survey
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
One-dimensional cutting stock problem to minimize the number of different patterns
New symmetry-less ILP formulation for the classical one dimensional bin-packing problem
Exact solution techniques for two-dimensional cutting and packing
Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
A hybrid heuristic to reduce the number of different patterns in cutting stock problems
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
The dissection of rectangles into squares
Arc-flow model for the two-dimensional guillotine cutting stock problem
Mathematical Methods of Organizing and Planning Production
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
Two-dimensional Cutting Stock with Multiple Stock Sizes
Pattern reduction in one-dimensional cutting stock problems
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Multistage Cutting Stock Problems of Two and More Dimensions
Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
Benchmarking optimization software with performance profiles.
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

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