Renan F. F. da Silva

According to our database, Renan F. F. da Silva authored at least 3 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver.

Renan F. F. da Silva, Thiago Alves de Queiroz, Rafael C. S. Schouery

CoRR, April, 2026

2024

Fast neighborhood search heuristics for the colored bin packing problem.

Renan F. F. da Silva, Yulle G. F. Borges, Rafael C. S. Schouery

Ann. Oper. Res., December, 2024

2023

Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem.

Renan F. F. da Silva, Yulle G. F. Borges, Rafael C. S. Schouery

CoRR, 2023