An Inexact Bundle Approach to Cutting-Stock Problems
INFORMS Journal on Computing · 2010 · Volume 22 · Issue 1
Abstract
We show that the linear programming relaxation of the cutting-stock problem can be solved efficiently by the recently proposed inexact bundle method. This method saves work by allowing inaccurate solutions to knapsack subproblems. With suitable rounding heuristics, our method solves almost all the cutting-stock instances from the literature.
Keywords
nondifferentiable convex optimization, Lagrangian relaxation, integer programming, bundle methods, knapsack problems, cutting stock
Enable JavaScript for citation tools and additional paper interactions.