====== Trabalho final ======

{{pf20231.pdf|Definição do trabalho}}

===== Trabalhos escolhidos =====

^ Nome ^ Titulo ^ 
| Andrey Schoier | [[https://www.hal.inserm.fr/INRIA/hal-00922670v1|Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions]] |
| Eduardo Fantini | [[https://doi.org/10.1016/j.cor.2015.10.014|Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization]] |
| Gustavo Delazeri | [[https://doi.org/10.1016/j.ejor.2022.04.037|Iterated local search for the placement of wildland fire suppression resources]] |
| Victor Guerra | [[https://ieeexplore.ieee.org/document/8894690|Resource-Aware Task Scheduling and Placement in Multi-FPGA System]] |
| Jordi Pujol | [[https://link.springer.com/article/10.1023/B:ANOR.0000039523.95673.33|An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem]] |
| Leonardo Ponzoni | [[http://doi.org/10.1016/j.asoc.2022.108653|Improving Ant Colony Optimization efficiency for solving large TSP instances]] |

===== Agenda =====

^ Data ^ Hora ^ Apresentação ^
| 21/08 | 13.30 | Gustavo Delazeri |
| :::   | 14.00 | <del>Andrey Schoier</del>   |
| 23/08 | 13.30 | Jordi Pujol      |
| 29/08 | 13.30 | Leonardo Ponzoni |
| :::   | 14.00 | Eduardo Fantini  |
| :::   | 14.30 | Victor Guerra    |