Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
Renan F. F. da Silva, Rafael C. S. Schouery

TL;DR
This paper introduces an advanced branch-cut-and-price framework with novel strategies like an extended Ryan-Foster scheme and fast column generation to efficiently solve complex Cutting Stock and related problems, achieving state-of-the-art results.
Contribution
The paper presents a novel extended Ryan-Foster branching scheme and a comprehensive framework that significantly improves solving complex cutting and packing problems.
Findings
Successfully solved several open instances of cutting stock problems.
Achieved state-of-the-art performance on multiple problem variants.
Introduced a new challenging benchmark for cutting stock problems.
Abstract
We present a branch-cut-and-price framework to solve Cutting Stock Problems with strong relaxations using Set Covering (Packing) Formulations, which are solved by column generation. The main contributions of this paper include an extended Ryan-Foster scheme, which allows us to use this powerful branching scheme even in non-binary problems by using a conflict propagation lemma; a fast column generation process based on a diversification strategy; custom primal heuristics, enabling us to find optimal solutions for several open instances; and a technique to use a smaller feasibility tolerance in floating-point linear programming solvers, combined with numerically safe methods to produce stronger and safer lower bounds. Additional performance-improving strategies include a technique that controls the height of the branch-and-bound tree; a variable selection algorithm based on branching…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Optimization and Packing Problems · Advanced Manufacturing and Logistics Optimization
