Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
DOI10.1007/S10878-022-00848-ZzbMATH Open1498.90217OpenAlexW4211226165MaRDI QIDQ2168751FDOQ2168751
Authors: Mateus Martin, Horacio Hideki Yanasse, Luiz L. Salles-Neto 
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00848-z
Recommendations
- Solution approaches for the cutting stock problem with setup cost
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- One-dimensional cutting stock problem to minimize the number of different patterns
cutting and packinginteger linear programmingmulti-objective optimizationcutting stock problemsetup cost
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- An improved typology of cutting and packing problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A new model for complete solutions to one-dimensional cutting stock problems.
- LP models for bin packing and cutting stock problems
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Pattern minimisation in cutting stock problems
- Random search in the one-dimensional cutting stock problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- Solution approaches for the cutting stock problem with setup cost
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Tighter relaxations for the cutting stock problem
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- In situ column generation for a cutting-stock problem
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Modified greedy heuristic for the one-dimensional cutting stock problem
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
Cited In (1)
This page was built for publication: Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168751)
