Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

DOI10.1007/s10878-022-00848-zzbMath1498.90217OpenAlexW4211226165MaRDI QIDQ2168751

Luiz L. Salles-Neto, Mateus Martin, Horacio Hideki Yanasse

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

zbMATH Keywords

multi-objective optimizationinteger linear programmingcutting stock problemcutting and packingsetup cost

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
• Solution approaches for the cutting stock problem with setup cost
• In situ column generation for a cutting-stock problem
• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Random search in the one-dimensional cutting stock problem
• 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.
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• Tighter relaxations for the cutting stock problem
• LP models for bin packing and cutting stock problems
• One-dimensional cutting stock problem to minimize the number of different patterns
• Pattern minimisation in cutting stock problems
• 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
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
• An improved typology of cutting and packing problems
• Mathematical Methods of Organizing and Planning Production
• C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
• A branch-and-price-and-cut algorithm for the pattern minimization problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Pattern reduction in one-dimensional cutting stock problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

This page was built for publication: Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost