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

DOI10.1007/978-3-642-13036-6_33zbMath1285.90051OpenAlexW1488921568MaRDI QIDQ3569837

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

Mathematics Subject Classification ID

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

Related Items (3)

Integer programming in parameterized complexity: five miniatures ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ Integer Programming in Parameterized Complexity: Three Miniatures.

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