Cutting stock with no three parts per pattern: work-in-process and pattern minimization
type: Item
instance of: scholarly article
title: Cutting stock with no three parts per pattern: work-in-process and pattern minimization
zbMATH Open document ID: 1241.90101
author: Alessandro Aloisio
author: Claudio Arbib
author: Fabrizio Marinelli
published in: Discrete Optimization
publication date: 2012-06-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6048257
zbMATH Keywords: cutting stock
zbMATH Keywords: pattern minimization
zbMATH Keywords: open stack minimization
zbMATH Keywords: set packing
describes a project that uses: CUTGEN1
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.10.002
OpenAlex ID: W2080652530
cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Setup and open-stacks minimization in one-dimensional stock cutting
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: On LP relaxations for the pattern minimization problem
cites work: A branch-and-price-and-cut algorithm for the pattern minimization problem
cites work: An integrated cutting stock and sequencing problem
cites work: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
cites work: Q3525910
cites work: Q5622195
cites work: Pattern minimisation in cutting stock problems
cites work: On the equal-subset-sum problem
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A linear algorithm for the Hamiltonian completion number of the line graph of a tree
cites work: Bin-packing and matchings in threshold graphs
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
DOI: 10.1016/J.DISOPT.2010.10.002
description: scientific article; zbMATH DE number 6048257