New lower bounds based on column generation and constraint programming for the pattern minimization problem
From MaRDI portal
Publication:1025240
DOI10.1016/j.cor.2009.01.008zbMath1162.90521OpenAlexW2074077571MaRDI QIDQ1025240
José M. Valério de Carvalho, Cláudio Alves, Rita Macedo
Publication date: 18 June 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.008
integer programminglower boundsconstraint programmingcutting and packing problemspattern minimization problem
Related Items (7)
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Combined cutting stock and lot-sizing problem with pattern setup ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ On LP relaxations for the pattern minimization problem ⋮ The min-conflict packing problem
Uses Software
Cites Work
- Unnamed Item
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- A survey of dual-feasible and superadditive functions
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- One-dimensional cutting stock problem to minimize the number of different patterns
- Constraint and integer programming. Toward a unified methodology.
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Pattern minimisation in cutting stock problems
- 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
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- 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
- New classes of fast lower bounds for bin packing problems
This page was built for publication: New lower bounds based on column generation and constraint programming for the pattern minimization problem
