A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
type: Item
instance of: scholarly article
title: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
zbMATH Open document ID: 1081.90590
DOI: 10.1016/S0377-2217(02)00125-X
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1829897
zbMATH Keywords: Cutting
zbMATH Keywords: Cutting planes
zbMATH Keywords: Column generation
zbMATH Keywords: Heuristics
zbMATH Keywords: Branch-and-bound
MaRDI profile type: Publication
cites work: Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
cites work: Q4398379
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: An instance of the cutting stock problem for which the rounding property does not hold
cites work: Q3993418
cites work: Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
cites work: Finding the Shortest Route between Two Points in a Network
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Tighter relaxations for the cutting stock problem
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: Q4848284
cites work: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
cites work: Q3805803
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)00125-x
OpenAlex ID: W2026751156
description: scientific article; zbMATH DE number 1829897