Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
type: Item
instance of: scholarly article
title: Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
zbMATH Open document ID: 1081.90589
DOI: 10.1016/S0377-2217(02)00126-1
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 1829898
zbMATH Keywords: Cutting
zbMATH Keywords: Integer programming
zbMATH Keywords: Linear programming
zbMATH Keywords: Column generation
zbMATH Keywords: Cost minimization
author: Oliver Holthaus
describes a project that uses: Bison
MaRDI profile type: Publication
cites work: Optimal Integer Solutions to Industrial Cutting Stock Problems
cites work: Q4349432
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: Optimal solutions for the cutting stock problem
cites work: Optimization of roll cutting in clothing industry
cites work: A sequential heuristic procedure for one-dimensional cutting
cites work: The cutting stock problem and integer rounding
cites work: An instance of the cutting stock problem for which the rounding property does not hold
cites work: Q3993418
cites work: Tighter relaxations for the cutting stock problem
cites work: Near-optimal solutions to one-dimensional cutting stock problems
cites work: Q4848284
cites work: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution
cites work: Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
full work available at URL: s0377-2217(02)00126-1
OpenAlex ID: W2155960341
description: scientific article; zbMATH DE number 1829898