- 16
- 8
- 1
Amadeu Almeida Coco
36%
Libre accès
25
Documents
Affiliations actuelles
- 500804
- 374570
Identifiants chercheurs
- amadeu-almeida-coco
- Google Scholar : https://scholar.google.fr/citations?user=oqwydLsAAAAJ
- 0000-0001-7257-7368
Présentation
Publications
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 20
- 12
- 7
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 14
- 4
- 5
- 3
- 4
- 1
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 5
- 1
- 2
- 2
- 1
- 1
- 5
- 1
- 3
The probabilistic drone routing problem applied to large-scale disasters23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03596238v1
|
|
The probabilistic drone routing problem applied to large-scale disasters32nd European Conference on Operational Research (EURO 2022), Jul 2022, Espoo, Finland
Communication dans un congrès
hal-03713972v1
|
|
|
Uma modelagem bi-objetivo para o problema da Árvore Geradora Mínima com Restrição de SaltosLIV Simpósio Brasileiro de Pesquisa Operacional, Sobrapo, Nov 2022, Juiz de Fora - MG, Brazil
Communication dans un congrès
hal-04197013v1
|
Solving the probabilistic drone routing problem for searching targets in case of disasters14th Metaheuristics International Conference, Jul 2022, Syracuse, Italy
Communication dans un congrès
hal-04197087v1
|
|
Addressing the scheduling problem for planned disruption on urban road networks23th International Congress of Mathematical Optimization (ISMP 2018), Jun 2018, Bordeaux, France
Communication dans un congrès
hal-02292123v1
|
|
Coupling scenario-based heuristics to exact methods for the robust weighted set covering problem with interval data8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM 2016), Jun 2016, Troyes, France. pp.455-460, ⟨10.1016/j.ifacol.2016.07.653⟩
Communication dans un congrès
hal-02301644v1
|
|
Scenario-based heuristics with path-relinking for the robust set covering problemXI Metaheuristic International Conference (MIC 2015), 2015, Agadir, Morocco
Communication dans un congrès
hal-02302046v1
|
|
|
Heurística de Refinamento para o Problema de Caminho Mais Curto RobustoXLVI Simpósio Brasileiro de Pesquisa Operacional, Sobrapo, Sep 2014, Salvador, Brazil
Communication dans un congrès
hal-04197060v1
|
Heurísticas e metaheurísticas para o problema do caminho mais curto robustoI workshop de Otimização sob dados Incertos (OSI 2014), Aug 2014, Belo Horizonte, Brazil
Communication dans un congrès
hal-02292198v1
|
|
Heurística de Refinamento para o Problema de Caminho Mais Curto RobustoXLVI Simpósio Brasileiro de Pesquisa Operacional (SBPO 2014), 2014, Salvador, Brazil
Communication dans un congrès
hal-02302634v1
|
|
Algoritmo baseado em BRKGA para o Problema de Árvore Geradora Mínima RobustaXLV Simpósio Brasileiro de Pesquisa Operacional (SBPO 2013), Sep 2013, Natal, Brazil
Communication dans un congrès
hal-02304057v1
|
|
Estudo comparativo entre formulações para o problema de caminho mais curto robustoSimpósio de Pesquisa Operacional e Logística da Marinha (SPOLM 2012), Aug 2012, Rio de Janeiro, Brazil
Communication dans un congrès
hal-02304065v1
|
|
|
Uma Heurística baseada em Iterated Local Search para o problema de Coloração Equilibrada de VérticesXVI Congreso Latino-Iberoamericano de Investigación Operativa / XLIV Simpósio Brasileiro de Pesquisa Operacional, Sobrapo; Claio, Sep 2012, Rio De Janeiro, Brazil
Communication dans un congrès
hal-04197071v1
|
A biased random-key genetic algorithm for the robust shortest path problemXI Global Optimization Workshop (GOW 2012), Jun 2012, Natal, Brazil
Communication dans un congrès
hal-02304066v1
|
|
Robust optimization criteria: state-of-the-art and new issues[Research Report] Université de Technologie de Troyes - UTT. 2014
Rapport
hal-02301939v1
|
|
Robust covering problems : formulations, algorithms and an applicationBusiness administration. Université de Technologie de Troyes; Universidade federal de Minas Gerais, 2017. English. ⟨NNT : 2017TROY0026⟩
Thèse
tel-02421538v1
|