2 papers
math.OC2025
Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
Renan F. F. da Silva, Rafael C. S. Schouery
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…
cs.AI2024
Fast Neighborhood Search Heuristics for the Colored Bin Packing Problem
Renan F. F. da Silva, Yulle G. F. Borges, Rafael C. S. Schouery
The Colored Bin Packing Problem (CBPP) is a generalization of the Bin Packing Problem (BPP). The CBPP consists of packing a set of items, each with a weight and a color, in bins of…