A Simulated Annealing Based Approach to the High School Timetabling Problem. - George H. G. Fonseca; Samuel S. Brito; Haroldo G. Santos (IDEAL, 2012)

A SA-VNS approach for the High School Timetabling Problem. - Samuel S. Brito; George H. G. Fonseca; Túlio A. M. Toffolo; Haroldo G. Santos; Marcone J. F. Souza (Electron. Notes Discret. Math., 2012)

A Local Search Approach for Binary Programming: Feasibility Search. - Samuel Souza Brito; Haroldo Gambini Santos; Bruno Henrique Miranda Santos (Hybrid Metaheuristics, 2014)

A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming. - Samuel Souza Brito; Haroldo Gambini Santos; Marcus Poggi (Electron. Notes Discret. Math., 2015)

GOAL solver: a hybrid local search based solver for high school timetabling. - George Henrique Godim da Fonseca; Haroldo Gambini Santos; Túlio Ângelo Machado Toffolo; Samuel Souza Brito; Marcone Jamilson Freitas Souza (Ann. Oper. Res., 2016)

Automatic integer programming reformulation using variable neighborhood search. - Samuel Souza Brito; Haroldo Gambini Santos (Electron. Notes Discret. Math., 2017)

Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. - Janniele A. S. Araujo; Haroldo G. Santos; Bernard Gendron; Sanjay Dominik Jena; Samuel S. Brito; Danilo S. Souza (Comput. Oper. Res., 2020)

Preprocessing and cutting planes with conflict graphs. - Samuel Souza Brito; Haroldo Gambini Santos (Comput. Oper. Res., 2021)