Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1594516
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- scientific article; zbMATH DE number 797002
- A combined approach to the solution to the general one-dimensional cutting stock problem
Cited in
(24)- The stochastic trim-loss problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- One-dimensional cutting stock problems and solution procedures
- A new model for complete solutions to one-dimensional cutting stock problems.
- Evaluation of algorithms for one-dimensional cutting
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- A combined approach to the solution to the general 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
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- scientific article; zbMATH DE number 1594516 (Why is no real title available?)
- 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
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Solving one-dimensional cutting stock problem with discrete demands and capacitated planning objective
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- scientific article; zbMATH DE number 1050896 (Why is no real title available?)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- scientific article; zbMATH DE number 2118229 (Why is no real title available?)
- scientific article; zbMATH DE number 797002 (Why is no real title available?)
- Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
- Large gaps in one-dimensional cutting stock problems
This page was built for publication: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658529)
