31 citations · 61 across the 3 of their papers we have counts for
4 papers
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes
Janniele A. S. Araujo, Haroldo Gambini Santos, Bernard Gendron +3
Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial optimization problems. A feasible RCPSP solution consists of a tim…
Preprocessing and Cutting Planes with Conflict Graphs
Samuel S. Brito, Haroldo G. Santos
This paper addresses the development of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: an efficient infrastructu…
Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches
Matheus Guedes Vilas Boas, Haroldo Gambini Santos, Luiz Henrique de Campos Merschmann +1
Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most researchers still…
Generic CP-Supported CMSA for Binary Integer Linear Programs
Christian Blum, Haroldo Gambini Santos
Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1) constructs feasible solution…