3 papers
cs.AI2023
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…
math.OC2023
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.DS2020
Approximation algorithms for the MAXSPACE advertisement problem
Mauro R. C. da Silva, Lehilton L. C. Pedrosa, Rafael C. S. Schouery
In MAXSPACE, given a set of ads $\cala$, one wants to schedule a subset ${\cala'\subseteq\cala}$ into slots of size . E…