8 citations · 12 across the 13 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
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…
cs.DS2026
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…