Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
From MaRDI portal
Publication:1847195
DOI10.1016/S0377-2217(02)00126-1zbMath1081.90589OpenAlexW2155960341MaRDI QIDQ1847195
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)00126-1
Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (13)
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ The generalized assortment and best cutting stock length problems ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ A two-objective mathematical model without cutting patterns for one-dimensional assortment problems ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ The one-dimensional cutting stock problem with sequence-dependent cut losses ⋮ Multi-commodity supply network planning in the forest supply chain ⋮ An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An instance of the cutting stock problem for which the rounding property does not hold
- Near-optimal solutions to one-dimensional cutting stock problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A sequential heuristic procedure for one-dimensional cutting
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Solving binary cutting stock problems by column generation and branch- and-bound
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Optimization of roll cutting in clothing industry
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Tighter relaxations for the cutting stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- Optimal solutions for the cutting stock problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
- The cutting stock problem and integer rounding
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
This page was built for publication: Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
