A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths

DOI10.1287/moor.1110.0515zbMath1246.68265OpenAlexW1982112521MaRDI QIDQ2884299

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

zbMATH Keywords

approximation algorithmmixed-integer programmingbin packingcutting stock problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mixed integer programming (90C11) Approximation algorithms (68W25)

Related Items (4)

Parameterized complexity of configuration integer programs ⋮ High-multiplicity \(N\)-fold IP via configuration LP ⋮ Unnamed Item ⋮ 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