An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths

DOI10.1007/978-3-642-13036-6_33zbMATH Open1285.90051OpenAlexW1488921568MaRDI QIDQ3569837FDOQ3569837

Authors: Roberto Solis-Oba, Klaus Jansen 

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_33

Recommendations

• A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Near-optimal solutions to one-dimensional cutting stock problems
• scientific article; zbMATH DE number 797002
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A near-optimal solution to a two-dimensional cutting stock problem
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• A new heuristic algorithm for the one-dimensional cutting stock problem
• A combined approach to the solution to the general one-dimensional cutting stock problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11)

Cited In (4)

• Integer programming in parameterized complexity: three miniatures
• A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
• Integer programming in parameterized complexity: five miniatures
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption

This page was built for publication: An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569837)