A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
From MaRDI portal
Publication:2884299
Recommendations
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
- Combinatorial complexity of a certain 1-dimensional cutting stock problem
- scientific article; zbMATH DE number 1050896
- A note on the approximability of cutting stock problems
- In situ column generation for a cutting-stock problem
- scientific article; zbMATH DE number 3854763
- Cutting and packing optimization. Problems modeling and solution methods.
- scientific article; zbMATH DE number 797002
- Tighter relaxations for the cutting stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
Cited in
(9)- scientific article; zbMATH DE number 7559382 (Why is no real title available?)
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
- High-multiplicity \(N\)-fold IP via configuration LP
- Polynomiality for bin packing with a constant number of item types
- Parameterized complexity of configuration integer programs
- Polynomiality for Bin Packing with a Constant Number of Item Types
- An approximation algorithm for the cutting-sticks problem
- A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- About the Structure of the Integer Cone and Its Application to Bin Packing
This page was built for publication: A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884299)
