8 citations · 12 across the 13 of their papers we have counts for
6 papers · 1 filter
Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
Renan F. F. da Silva, Thiago A. de Queiroz, Rafael C. S. Schouery
The Knapsack Problem (KP) and its generalization, the Bounded Knapsack Problem (BKP), are classical NP-hard problems with numerous practical applications, and despite being introdu…
Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
Renan Fernando Franco da Silva, Vinícius Loti de Lima, Rafael C. S. Schouery +2
The Cutting Stock Problem (CSP) and Bin Packing Problem (BPP) are classical combinatorial optimization problems extensively studied since the 1960s. State-of-the-art exact algorith…
Approximation algorithms for the square min-sum bin packing problem
Rachel Vanucchi Saraiva, Rafael C. S. Schouery
In this work, we study the Square Min-Sum Bin Packing Problem (SMSBPP), where a list of square items has to be packed into square bins of dimensions with no overla…
Computing the Largest Bond and the Maximum Connected Cut of a Graph
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka +6
The cut-set of a graph is the set of edges that have one endpoint in and the other endpoint in , and whenever is connected…
Computing the largest bond of a graph
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa +2
A bond of a graph is an inclusion-wise minimal disconnecting set of , i.e., bonds are cut-sets that determine cuts of such that and $G[V\setmin…
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery +2
We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augme…