New lower bounds based on column generation and constraint programming for the pattern minimization problem
type: Item
instance of: scholarly article
title: New lower bounds based on column generation and constraint programming for the pattern minimization problem
zbMATH Open document ID: 1162.90521
author: Cláudio Alves
author: Rita Macedo
author: José Valério de Carvalho
published in: Computers \& Operations Research
publication date: 2009-06-18T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5566387
zbMATH Keywords: cutting and packing problems
zbMATH Keywords: pattern minimization problem
zbMATH Keywords: lower bounds
zbMATH Keywords: integer programming
zbMATH Keywords: constraint programming
describes a project that uses: CUTGEN1
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2009.01.008
OpenAlex ID: W2074077571
cites work: Cutting stock with no three parts per pattern: work-in-process and pattern minimization
cites work: A branch-and-price-and-cut algorithm for the pattern minimization problem
cites work: A simulated annealing heuristic for the one-dimensional cutting stock problem
cites work: A survey of dual-feasible and superadditive functions
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: New classes of fast lower bounds for bin packing problems
cites work: Pattern reduction in one-dimensional cutting stock problems
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems
cites work: Q3993418
cites work: Pattern minimisation in cutting stock problems
cites work: Constraint and integer programming. Toward a unified methodology.
cites work: Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
cites work: One-dimensional cutting stock problem to minimize the number of different patterns
cites work: One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
cites work: An improved typology of cutting and packing problems
cites work: A hybrid heuristic to reduce the number of different patterns in cutting stock problems
DOI: 10.1016/J.COR.2009.01.008
description: scientific article; zbMATH DE number 5566387