Amadeu Almeida Coco
Title
Cited by
Cited by
Year
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
AA Coco, JCA Júnior, TF Noronha, AC Santos
Journal of Global Optimization 60 (2), 265-287, 2014
212014
Senario-based heuristics with path-relinking for the robust set covering problem
AA Coco, AC Santos, TF Noronha
Proceedings of the XI Metaheuristics International Conference (MIC), 2015
122015
Robust optimization criteria: state-of-the-art and new issues
A Coco, E Solano-Charris, AC Santos, C Prins, TF de Noronha
Université de Technologie de Troyes-UTT, 2014
122014
Modeling and solving the multi-period disruptions scheduling problem on urban networks
AA Coco, C Duhamel, AC Santos
Annals of Operations Research 285 (1), 427-443, 2020
62020
Formulation and algorithms for the robust maximal covering location problem
AA Coco, AC Santos, TF Noronha
Electronic Notes in Discrete Mathematics 64, 145-154, 2018
52018
Algoritmo baseado em BRKGA para o problema de árvore geradora mínima robusta
AA Coco, TF de Noronha, AC Santos
XLV Simpósio Brasileiro de Pesquisa Operacional (SBPO 2013), 2013
22013
A biased random-key genetic algorithm for the robust shortest path problem
AA Coco, TF Noronha, AC Santos
GLOBAL OPTIMIZATION WORKSHOP 2012, 53-56, 2012
22012
Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
AA Coco, JCA Júnior, TF Noronha, AC Santos
Journal of Global Optimization 68 (2), 463-466, 2017
12017
Coupling scenario-based heuristics to exact methods for the robust weighted set covering problem with interval data
AA Coco, AC Santos, TF Noronha
IFAC-PapersOnLine 49 (12), 455-460, 2016
12016
A min-max regret approach for the Steiner Tree Problem with Interval Costs
IA Carvalho, AA Coco, TF Noronha, C Duhamel
arXiv preprint arXiv:2101.03347, 2021
2021
Addressing the scheduling problem for planned disruption on urban road networks
AA Coco, C Duhamel, AC Santos
23th International Congress of Mathematical Optimization (ISMP 2018), 2018
2018
Robust covering problems: formulations, algorithms and application
AA Coco
Universidade Federal de Minas Gerais, 2017
2017
Heurísticas e metaheurísticas para o problema do caminho mais curto robusto
AA Coco, TF de Noronha, AC Santos
I workshop de Otimização sob dados Incertos (OSI 2014), 2014
2014
Heurística de Refinamento para o Problema de Caminho Mais Curto Robusto
AA Coco, TF de Noronha, AC Santos
Proceedings of the XLVI Simpósio Brasileiro de Pesquisa Operacional (SBPO …, 2014
2014
Heurísticas para o problema de caminho mais curto robusto
AA Coco
Universidade Federal de Minas Gerais, 2013
2013
Uma Heurıstica baseada em Iterated Local Search para o problema de Coloraç ao Equilibrada de Vértices
AA Coco, TF Noronha, BHM Gerais–Brazil
2012
Estudo comparativo entre formulações para o problema de caminho mais curto robusto
JCA Júnior, AA Coco, TF Noronha, AC Santos
Simpósio de Pesquisa Operacional e Logística da Marinha (SPOLM 2012), 2012
2012
Rapport Technique
AA Coco, EL Solano-Charris, AC Santos, C Prins, T Noronha
The system can't perform the operation now. Try again later.
Articles 1–18