A note on the approximability of cutting stock problems
From MaRDI portal
Recommendations
- The two-dimensional cutting stock problem revisited
- Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A near-optimal solution to a two-dimensional cutting stock problem
- On the effectivity of gradient methods for cutting stock problems
Cites work
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- An improved typology of cutting and packing problems
- An LP-based approach to cutting stock problems with multiple objectives
- An on-line algorithm for multidimensional bin packing
- Bin packing can be solved within 1+epsilon in linear time
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- On Packing Two-Dimensional Bins
- The modified integer round-up property of the one-dimensional cutting stock problem
Cited in
(11)- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
- An inexact bundle approach to cutting-stock problems
- Combinatorial complexity of a certain 1-dimensional cutting stock problem
- The generalized assortment and best cutting stock length problems
- The cutting stock problem and integer rounding
- scientific article; zbMATH DE number 710068 (Why is no real title available?)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
This page was built for publication: A note on the approximability of cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643962)
