Hybrid Metaheuristics: 11th International Workshop, HM 2019, Concepción, Chile, January 16-18, 2019, Proceedings von Blesa Aguilera, Maria J, Blum, Christian, Gambini Santos, Haroldo, Pinacho-Davidson, Pedro, Godoy del Campo, Julio

Volltext

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

Volltext

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

Volltext

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

Volltext

A general‐purpose distributed computing Java middleware von 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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

A Local Search Approach for Binary Programming: Feasibility Search von Souza Brito, Samuel, Gambini Santos, Haroldo, Miranda Santos, Bruno Henrique

Volltext

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

Volltext

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

Volltext

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

Volltext

Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO von Thiruvady, Dhananjay, Blum, Christian, Ernst, Andreas T.

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext