Ferramentas de Utilizador
cmp268:2019-1-trabalhos
Diferenças
Esta página mostra as diferenças entre as duas revisões da página.
| Ambos os lados da revisão anterior Revisão anterior Próxima revisão | Revisão anterior | ||
|
cmp268:2019-1-trabalhos [2019/07/01 14:42] marcus [Trabalhos escolhidos] |
cmp268:2019-1-trabalhos [2019/07/03 16:05] (Actual) marcus [Trabalhos escolhidos] |
||
|---|---|---|---|
| Linha 5: | Linha 5: | ||
| ===== Trabalhos escolhidos ===== | ===== Trabalhos escolhidos ===== | ||
| - | ^ Nome ^ Titulo ^ | + | ^ Nome ^ Titulo ^ E ^ |
| - | | Kennya | [[https://doi.org/10.1016/j.ejor.2011.01.011|Genetic algorithms for the unrelated parallel machine scheduling problem with sequence dependent setup times]] | | + | | Kennya | [[https://doi.org/10.1016/j.ejor.2011.01.011|Genetic algorithms for the unrelated parallel machine scheduling problem with sequence dependent setup times]] | o | |
| - | | Luísa | [[https://www.aaai.org/Library/AAAI/2007/aaai07-160.php|Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning]] | | + | | Luísa | [[https://www.aaai.org/Library/AAAI/2007/aaai07-160.php|Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning]] | o | |
| - | | Gabriel | A general variable neighborhood search variants for the travelling salesman problem with draft limits | | + | | Gabriel M.L. | [[https://doi.org/10.1007/s11590-014-0788-9|A general variable neighborhood search variants for the travelling salesman problem with draft limits]] | o | |
| - | | Candy | [[https://doi.org/10.1016/j.cor.2011.12.006|Probabilistic GRASP-Tabu search algorithms for the UBQP problem]] | | + | | Candy | [[https://doi.org/10.1016/j.cor.2011.12.006|Probabilistic GRASP-Tabu search algorithms for the UBQP problem]] | | |
| - | | José | [[https://doi.org/10.1016/j.neucom.2017.04.053|Hybrid Whale Optimization Algorithm with simulated annealing for feature selection]] | | + | | José | [[https://doi.org/10.1016/j.neucom.2017.04.053|Hybrid Whale Optimization Algorithm with simulated annealing for feature selection]] | o | |
| - | | Gabriel | [[https://doi.org/10.1016/j.ejor.2015.05.038|An efficient local search heuristic with row weighting for the unicost set covering problem]] | | + | | Gabriel A.P. | [[https://doi.org/10.1016/j.ejor.2015.05.038|An efficient local search heuristic with row weighting for the unicost set covering problem]] | o | |
| ===== Agenda ===== | ===== Agenda ===== | ||
cmp268/2019-1-trabalhos.1562002947.txt.gz · Esta página foi modificada pela última vez em: 2019/07/01 14:42 por marcus
Ferramentas de Página
Excepto menção em contrário, o conteúdo neste wiki está sob a seguinte licença: CC Attribution-Noncommercial-Share Alike 4.0 International
