Haroldo G. Santos

Orcid: 0000-0002-4759-0680

According to our database1, Haroldo G. Santos authored at least 43 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Cover by disjoint cliques cuts for the knapsack problem with conflicting items.
Oper. Res. Lett., 2021

Optimal decision trees for the algorithm selection problem: integer programming based approaches.
Int. Trans. Oper. Res., 2021

Preprocessing and cutting planes with conflict graphs.
Comput. Oper. Res., 2021

The tactical berth allocation problem with time-variant specific quay crane assignments.
Comput. Ind. Eng., 2021

2020
A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus.
Future Internet, 2020

Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes.
Comput. Oper. Res., 2020

Feasibility Analysis in Tracking Algorithms for Pattern Recognition Through the Lip Articulators.
IEEE Access, 2020

2019
Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem.
Int. Trans. Oper. Res., 2019

A general-purpose distributed computing Java middleware.
Concurr. Comput. Pract. Exp., 2019

Generic CP-Supported CMSA for Binary Integer Linear Programs.
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

2018
5th International Conference on Variable Neighborhood Search (ICVNS'17).
Electron. Notes Discret. Math., 2018

Optimal Decision Trees for Feature Based Parameter Tuning: Integer Programming Model and VNS Heuristic.
Electron. Notes Discret. Math., 2018

2017
Limited memory Rank-1 Cuts for Vehicle Routing Problems.
Oper. Res. Lett., 2017

Integer programming techniques for educational timetabling.
Eur. J. Oper. Res., 2017

Drawing graphs with mathematical programming and variable neighborhood search.
Electron. Notes Discret. Math., 2017

Variable neighborhood search accelerated column generation for the nurse rostering problem.
Electron. Notes Discret. Math., 2017

Automatic integer programming reformulation using variable neighborhood search.
Electron. Notes Discret. Math., 2017

A Hybrid CPU-GPU Scatter Search for Large-Sized Generalized Assignment Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Separation Strategies for Chvátal-Gomory Cuts in Resource Constrained Project Scheduling Problems: A Computational Study.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

A Hybrid Heuristic in GPU-CPU Based on Scatter Search for the Generalized Assignment Problem.
Proceedings of the International Conference on Computational Science, 2017

Data Mining Approach for Feature Based Parameter Tunning for Mixed-Integer Programming Solvers.
Proceedings of the International Conference on Computational Science, 2017

2016
An integer programming approach to the multimode resource-constrained multiproject scheduling problem.
J. Sched., 2016

Late acceptance hill-climbing for high school timetabling.
J. Sched., 2016

Integrating matheuristics and metaheuristics for timetabling.
Comput. Oper. Res., 2016

Integer programming techniques for the nurse rostering problem.
Ann. Oper. Res., 2016

GOAL solver: a hybrid local search based solver for high school timetabling.
Ann. Oper. Res., 2016

Neighborhood Composition Strategies in Stochastic Local Search.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

2015
A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming.
Electron. Notes Discret. Math., 2015

2014
Variable Neighborhood Search based algorithms for high school timetabling.
Comput. Oper. Res., 2014

XHSTT: an XML archive for high school timetabling problems in different countries.
Ann. Oper. Res., 2014

A Local Search Approach for Binary Programming: Feasibility Search.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

2013
Characterization of FHSS in Wireless Personal Area Networks.
Proceedings of the 22nd Wireless and Optical Communication Conference, 2013

Ensemble of classifiers for remote sensed hyperspectral land cover analysis: An approach based on Linear Programming and Weighted Linear Combination.
Proceedings of the 2013 IEEE International Geoscience and Remote Sensing Symposium, 2013

A Pre-processing Aware RINS Based MIP Heuristic.
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Memetic Algorithms for the High School Timetabling Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A SA-VNS approach for the High School Timetabling Problem.
Electron. Notes Discret. Math., 2012

Strong bounds with cut and column generation for class-teacher timetabling.
Ann. Oper. Res., 2012

GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times.
Proceedings of the 31st International Conference of the Chilean Computer Science Society, 2012

A Simulated Annealing Based Approach to the High School Timetabling Problem.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2012, 2012

2010
A hybrid heuristic algorithm for the open-pit-mining operational planning problem.
Eur. J. Oper. Res., 2010

2006
Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem.
Neurocomputing, 2006

2005
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem.
ACM J. Exp. Algorithmics, 2005

2004
An Efficient Tabu Search Heuristic for the School Timetabling Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004


  Loading...