An Efficient Tabu Search Heuristic for the School Timetabling Problem. - Haroldo G. Santos; Luiz Satoru Ochi; Marcone J. F. Souza (WEA, 2004)

A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem. - Haroldo G. Santos; Luiz Satoru Ochi; Marcone J. F. Souza (ACM J. Exp. Algorithmics, 2005)

Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. - Haroldo G. Santos; Luiz Satoru Ochi; E. H. Marinho; Lúcia M. A. Drummond (Neurocomputing, 2006)

A hybrid heuristic algorithm for the open-pit-mining operational planning problem. - Marcone J. F. Souza; Igor Machado Coelho; Sabir Ribas; Haroldo G. Santos; Luiz Henrique de Campos Merschmann (Eur. J. Oper. Res., 2010)

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

GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times. - Matheus Nohra Haddad; Igor Machado Coelho; Marcone Jamilson Freitas Souza; Luiz Satoru Ochi; Haroldo Gambini Santos; Alexandre Xavier Martins (SCCC, 2012)

Strong bounds with cut and column generation for class-teacher timetabling. - Haroldo G. Santos; Eduardo Uchoa; Luiz Satoru Ochi; Nelson Maculan (Ann. Oper. Res., 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)

Memetic Algorithms for the High School Timetabling Problem. - George H. G. Fonseca; Haroldo G. Santos (IEEE Congress on Evolutionary Computation, 2013)

A Pre-processing Aware RINS Based MIP Heuristic. - Thiago M. Gomes; Haroldo G. Santos; Marcone J. F. Souza (Hybrid Metaheuristics, 2013)

Ensemble of classifiers for remote sensed hyperspectral land cover analysis: An approach based on Linear Programming and Weighted Linear Combination. - Sandro Luiz Jailson Lopes Tinôco; Haroldo Gambini Santos; David Menotti; Andrey Bicalho Santos; Jefersson Alex dos Santos (IGARSS, 2013)

Characterization of FHSS in Wireless Personal Area Networks. - Celio Marcio Soares Ferreira; Ricardo Augusto Rabelo Oliveira; Haroldo Gambini Santos; Alejandro C. Frery (WOCC, 2013)

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

XHSTT: an XML archive for high school timetabling problems in different countries. - Gerhard Post; Jeffrey H. Kingston; Samad Ahmadi; Sophia Daskalaki; Christos Gogos; Jari Kyngäs; Cimmo Nurmi; Nysret Musliu; Nelishia Pillay; Haroldo G. Santos; Andrea Schaerf (Ann. Oper. Res., 2014)

Variable Neighborhood Search based algorithms for high school timetabling. - George H. G. Fonseca; Haroldo G. Santos (Comput. Oper. Res., 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)

Neighborhood Composition Strategies in Stochastic Local Search. - Janniele A. S. Araujo; Haroldo G. Santos; Davi D. Baltar; Túlio A. M. Toffolo; Tony Wauters (HM, 2016)

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)

Integer programming techniques for the nurse rostering problem. - Haroldo G. Santos; Túlio A. M. Toffolo; Rafael A. M. Gomes; Sabir Ribas (Ann. Oper. Res., 2016)

Integrating matheuristics and metaheuristics for timetabling. - George H. G. Fonseca; Haroldo G. Santos; Eduardo G. Carrano (Comput. Oper. Res., 2016)

Late acceptance hill-climbing for high school timetabling. - George H. G. Fonseca; Haroldo G. Santos; Eduardo G. Carrano (J. Sched., 2016)

An integer programming approach to the multimode resource-constrained multiproject scheduling problem. - Túlio A. M. Toffolo; Haroldo G. Santos; Marco Antonio Moreira de Carvalho; Janniele A. Soares (J. Sched., 2016)

Data Mining Approach for Feature Based Parameter Tunning for Mixed-Integer Programming Solvers. - Matheus G. Vilas Boas; Haroldo G. Santos; Rafael de S. O. Martins; Luiz H. C. Merschmann (ICCS, 2017)

A Hybrid Heuristic in GPU-CPU Based on Scatter Search for the Generalized Assignment Problem. - Danilo S. Souza; Haroldo G. Santos; Igor Machado Coelho (ICCS, 2017)

Separation Strategies for Chvátal-Gomory Cuts in Resource Constrained Project Scheduling Problems: A Computational Study. - Janniele Aparecida Soares Araujo; Haroldo Gambini Santos (ICCSA (1), 2017)

A Hybrid CPU-GPU Scatter Search for Large-Sized Generalized Assignment Problems. - Danilo S. Souza; Haroldo G. Santos; Igor Machado Coelho; Janniele A. S. Araujo (ICCSA (1), 2017)

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

Variable neighborhood search accelerated column generation for the nurse rostering problem. - Rafael A. M. Gomes; Túlio A. M. Toffolo; Haroldo Gambini Santos (Electron. Notes Discret. Math., 2017)

Drawing graphs with mathematical programming and variable neighborhood search. - Cézar Augusto N. e Silva; Haroldo Gambini Santos (Electron. Notes Discret. Math., 2017)

Integer programming techniques for educational timetabling. - George H. G. Fonseca; Haroldo G. Santos; Eduardo G. Carrano; Thomas R. Stidsen (Eur. J. Oper. Res., 2017)

Limited memory Rank-1 Cuts for Vehicle Routing Problems. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa; Haroldo G. Santos (Oper. Res. Lett., 2017)

Optimal Decision Trees for Feature Based Parameter Tuning: Integer Programming Model and VNS Heuristic. - Matheus G. Vilas Boas; Haroldo Gambini Santos; Luiz Henrique de Campos Merschmann (Electron. Notes Discret. Math., 2018)

5th International Conference on Variable Neighborhood Search (ICVNS'17). - Vitor Nazário Coelho; Haroldo Gambini Santos; Igor Machado Coelho; Puca Huachi Vaz Penna; Thays A. Oliveira; Marcone Jamilson Freitas Souza; Angelo Sifaleras (Electron. Notes Discret. Math., 2018)

Generic CP-Supported CMSA for Binary Integer Linear Programs. - Christian Blum 001; Haroldo Gambini Santos (HM, 2019)

A general-purpose distributed computing Java middleware. - André Luís Barroso Almeida; Leonardo de Souza Cimino; José Estevão Eugênio de Resende; Lucas Henrique Moreira Silva; Samuel Queiroz Souza Rocha; Guilherme Aparecido Gregorio; Gustavo Silva Paiva; Saul E. Delabrida; Haroldo Gambini Santos; Marco Antonio Moreira de Carvalho; André Luiz Lins de Aquino; Joubert de Castro Lima (Concurr. Comput. Pract. Exp., 2019)

Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem. - Haroldo G. Santos; Túlio A. M. Toffolo; Cristiano L. T. F. Silva; Greet Vanden Berghe (Int. Trans. Oper. Res., 2019)

Feasibility Analysis in Tracking Algorithms for Pattern Recognition Through the Lip Articulators. - Haroldo G. Santos; Roberto Limão; Adam Santos 001 (IEEE Access, 2020)

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)

A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus. - Vitor Nazário Coelho; Rodolfo Pereira Araujo; Haroldo Gambini Santos; Wang Yong Qiang; Igor Machado Coelho (Future Internet, 2020)

The tactical berth allocation problem with time-variant specific quay crane assignments. - Emmanouil Thanos; Túlio A. M. Toffolo; Haroldo Gambini Santos; Wim Vancroonenburg; Greet Vanden Berghe (Comput. Ind. Eng., 2021)

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

Optimal decision trees for the algorithm selection problem: integer programming based approaches. - Matheus Guedes Vilas Boas; Haroldo Gambini Santos; Luiz Henrique de Campos Merschmann; Greet Vanden Berghe (Int. Trans. Oper. Res., 2021)

Cover by disjoint cliques cuts for the knapsack problem with conflicting items. - Thiago Alcântara Luiz; Haroldo Gambini Santos; Eduardo Uchoa (Oper. Res. Lett., 2021)