Modeling multistage cutting stock problems
From MaRDI portal
Recommendations
- Row and column generation technique for a multistage cutting stock problem
- Algorithms for the one-dimensional two-stage cutting stock problem
- An LP-based approach to a two-stage cutting stock problem
- Cutting Stock Problems
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A two-phase roll cutting problem
- An LP-based approach to a two-stage cutting stock problem
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- Multistage Cutting Stock Problems of Two and More Dimensions
- Row and column generation technique for a multistage cutting stock problem
Cited in
(10)- The constrained compartmentalised knapsack problem
- Algorithms for the one-dimensional two-stage cutting stock problem
- Row and column generation technique for a multistage cutting stock problem
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- A note on ``A LP-based heuristic for a time-constrained routing problem
- A bi-integrated model for coupling lot-sizing and cutting-stock problems
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Two-Stage Cutting Stock Problem with Due Dates
This page was built for publication: Modeling multistage cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847197)