A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
From MaRDI portal
Publication:2884299
DOI10.1287/MOOR.1110.0515zbMATH Open1246.68265OpenAlexW1982112521MaRDI QIDQ2884299FDOQ2884299
Authors: Roberto Solis-Oba, Klaus Jansen 
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1110.0515
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)
- Title not available (Why is that?)
- 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
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Parameterized complexity of configuration integer programs
- 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)
