Modeling multistage cutting stock problems

DOI10.1016/S0377-2217(02)00127-3zbMath1081.90588OpenAlexW2087981311MaRDI QIDQ1847197

Yanyan Li

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00127-3

zbMATH Keywords

Linear programmingLarge-scale optimizationMultistage cutting stock problemRow-and-column generation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (7)

The constrained compartmentalised knapsack problem ⋮ A note on ``A LP-based heuristic for a time-constrained routing problem ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ A bi-integrated model for coupling lot-sizing and cutting-stock problems

Cites Work

• Unnamed Item
• Unnamed Item
• An LP-based approach to a two-stage cutting stock problem
• Row and column generation technique for a multistage cutting stock problem
• A two-phase roll cutting problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem

This page was built for publication: Modeling multistage cutting stock problems