One-dimensional cutting stock problem to minimize the number of different patterns
From MaRDI portal
Recommendations
- Pattern reduction in one-dimensional cutting stock problems
- Pattern minimisation in cutting stock problems
- Near-optimal solutions to one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A combined approach to the solution to the general one-dimensional cutting stock problem
- Nonlinear cutting stock problem model to minimize the number of different patterns and objects
- A heuristic approach to one-dimensional cutting stock problem
- Limiting the number of each piece in two-dimensional cutting stock patterns
- scientific article; zbMATH DE number 1803213
- The One Dimensional Cutting Stock Problem Using Two Objectives
Cites work
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3999654 (Why is no real title available?)
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A sequential heuristic procedure for one-dimensional cutting
- Approximate Algorithms for the 0/1 Knapsack Problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Cutting stock problems and solution procedures
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- Optimal solutions for the cutting stock problem
- Pattern minimisation in cutting stock problems
- Random search in the one-dimensional cutting stock problem
Cited in
(30)- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Heuristic algorithms based on column generation for an online product shipping problem
- On LP relaxations for the pattern minimization problem
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- A note on ``Reducing the number of binary variables in cutting stock problems
- An effective solution for a real cutting stock problem in manufacturing plastic rolls
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
- Facets of a mixed-integer bilinear covering set with bounds on variables
- scientific article; zbMATH DE number 1803213 (Why is no real title available?)
- In situ column generation for a cutting-stock problem
- Two-dimensional cutting stock problem with sequence dependent setup times
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Combinatorial complexity of a certain 1-dimensional cutting stock problem
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Alternative configurations for cutting machines in a tube cutting mill
- Optimal job splitting on a multi-slot machine with applications in the printing industry
- Solution approaches for the cutting stock problem with setup cost
- On the facet defining inequalities of the mixed-integer bilinear covering set
- One-dimensional cutting stock optimization in consecutive time periods
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- On the one-dimensional stock cutting problem in the paper tube industry
- Multi-commodity supply network planning in the forest supply chain
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
This page was built for publication: One-dimensional cutting stock problem to minimize the number of different patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869576)
