scientific article; zbMATH DE number 797002
From MaRDI portal
Publication:4848284
Recommendations
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- scientific article; zbMATH DE number 1594516
- scientific article; zbMATH DE number 1050896
- scientific article; zbMATH DE number 2118229
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
Cited in
(24)- The stochastic trim-loss problem
- The modified integer round-up property of the one-dimensional cutting stock problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- 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 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 simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- A branch-and-price algorithm for the temporal bin packing problem
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- scientific article; zbMATH DE number 1594516 (Why is no real title available?)
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- 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?)
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Algorithms for the one-dimensional two-stage cutting stock problem
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- On the bin packing problem with a fixed number of object weights
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848284)
