Search Results - "Gambini Santos, Haroldo"

A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus by Nazário Coelho, Vitor, Pereira Araújo, Rodolfo, Gambini Santos, Haroldo, Yong Qiang, Wang, Machado Coelho, Igor

“…Mixed-integer mathematical programming has been widely used to model and solve challenging optimization problems. One interesting feature of this technique is…”
Get full text

Optimal decision trees for the algorithm selection problem: integer programming based approaches by Vilas Boas, Matheus Guedes, Santos, Haroldo Gambini, Merschmann, Luiz Henrique de Campos, Vanden Berghe, Greet

“…Even though it is well known that for most relevant computational problems, different algorithms may perform better on different classes of problem instances,…”
Get full text

Variable neighborhood search accelerated column generation for the nurse rostering problem by Gomes, Rafael A.M., Toffolo, Túlio A.M., Santos, Haroldo Gambini

“…The Nurse Rostering Problem (NRP) is an optimization problem where nurses with specific skills must be assigned shifts in a schedule. The objective is to…”
Get full text

A general‐purpose distributed computing Java middleware by Almeida, André Luís Barroso, Cimino, Leonardo de Souza, Resende, José Estevão Eugênio, Silva, Lucas Henrique Moreira, Rocha, Samuel Queiroz Souza, Gregorio, Guilherme Aparecido, Paiva, Gustavo Silva, Delabrida, Saul, Santos, Haroldo Gambini, Carvalho, Marco Antonio Moreira, Aquino, Andre Luiz Lins, Lima, Joubert de Castro

“…Summary The middleware solutions for General‐Purpose Distributed Computing (GPDC) have distinct requirements, such as task scheduling, processing/storage fault…”
Get full text

Preprocessing and cutting planes with conflict graphs by Brito, Samuel Souza, Santos, Haroldo Gambini

“…•An efficient infrastructure for the construction and manipulation of conflict graphs.•A clique separator that obtained better bounds than a state-of-the-art…”
Get full text

The tactical berth allocation problem with time-variant specific quay crane assignments by Thanos, Emmanouil, Toffolo, Tulio, Santos, Haroldo Gambini, Vancroonenburg, Wim, Vanden Berghe, Greet

“…•The continuous berth allocation problem with time-variant, specific quay crane assignments is studied at a tactical level.•A MIP model is introduced and…”
Get full text

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes by Araujo, Janniele A. S, Santos, Haroldo Gambini, Gendron, Bernard, Jena, Sanjay Dominik, Brito, Samuel S, Souzaa, Danilo S

“…Computers & Operations Research (2019) Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial…”
Get full text

Cover by disjoint cliques cuts for the knapsack problem with conflicting items by Luiz, Thiago Alcântara, Santos, Haroldo Gambini, Uchoa, Eduardo

“…•A new family of strong combinatorial cutting planes, the CDC cuts, is proposed.•A subfamily of CDC cuts can be facet-defining under certain natural…”
Get full text

Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches by Boas, Matheus Guedes Vilas, Santos, Haroldo Gambini, Merschmann, Luiz Henrique de Campos, Berghe, Greet Vanden

“…Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances,…”
Get full text

Strong bounds with cut and column generation for class-teacher timetabling by Santos, Haroldo Gambini, Uchoa, Eduardo, Ochi, Luiz Satoru, Maculan, Nelson

“…This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher…”
Get full text

Variable Neighborhood Search based algorithms for high school timetabling by Fonseca, George H.G., Santos, Haroldo G.

“…This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the…”
Get full text

Automatic integer programming reformulation using variable neighborhood search by Brito, Samuel Souza, Santos, Haroldo Gambini

“…Chvàtal-Gomory cuts are well-known cutting planes for Integer Programming problems. As shown in previous works, the inclusion of these cuts allows to…”
Get full text

Drawing graphs with mathematical programming and variable neighborhood search by e Silva, Cézar Augusto N., Santos, Haroldo Gambini

“…In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. To produce clear, easy to read diagrams, this problem is…”
Get full text

A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming by Brito, Samuel Souza, Santos, Haroldo Gambini, Poggi, Marcus

“…This work explores the fast creation of densely populated conflict graphs at the root node of the search tree for integer programs. We show that not only the…”
Get full text

GOAL solver: a hybrid local search based solver for high school timetabling by da Fonseca, George Henrique Godim, Santos, Haroldo Gambini, Toffolo, Túlio Ângelo Machado, Brito, Samuel Souza, Souza, Marcone Jamilson Freitas

“…This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International…”
Get full text

Optimal Decision Trees for Feature Based Parameter Tuning: Integer Programming Model and VNS Heuristic by Vilas Boas, Matheus Guedes, Santos, Haroldo Gambini, de Campos Merschmann, Luiz Henrique

“…In this paper we propose a hybrid approach for the Feature Based Parameter Tuning Problem (FBPTP) of Mixed-Integer Programming (MIP) solvers. These solvers are…”
Get full text

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

“…This volume presents selected, peer-reviewed, short papers that were accepted for presentation in the 5th International Conference on Variable Neighborhood…”
Get full text

Generic CP-Supported CMSA for Binary Integer Linear Programs by Blum, Christian, Santos, Haroldo Gambini

“…Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1)…”
Get full text

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

“…This work addresses the Unrelated Parallel Machine Scheduling Problem where setup times are sequence-dependent and machine-dependent, the UPMSPST. The maximum…”
Get full text

Characterization of FHSS in Wireless Personal Area Networks by Soares Ferreira, Celio Marcio, Rabelo Oliveira, Ricardo Augusto, Gambini, Haroldo Santos, Frery, Alejandro C.

“…The potential of WPAN - Wireless Personal Network applications is virtually untapped. The low cost and its presence in most mobile devices make Bluetooth…”
Get full text