Tabela de Conteúdos
Trabalho final
Trabalhos escolhidos
Agenda
Trabalho final
Definição do trabalho
Trabalhos escolhidos
Nome
Titulo
E
Kennya
Genetic algorithms for the unrelated parallel machine scheduling problem with sequence dependent setup times
o
Luísa
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
o
Gabriel M.L.
A general variable neighborhood search variants for the travelling salesman problem with draft limits
o
Candy
Probabilistic GRASP-Tabu search algorithms for the UBQP problem
José
Hybrid Whale Optimization Algorithm with simulated annealing for feature selection
o
Gabriel A.P.
An efficient local search heuristic with row weighting for the unicost set covering problem
o
Agenda
Data
Hora
Apresentação
01/07
13.30
Kennya
01/07
14.00
José
01/07
14.30
Candy
03/07
13.30
Gabriel Langeloh
03/07
14.00
Gabriel Ammes
03/07
14.30
Luísa