Igor Machado Coelho

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Elias L. Marques

> Home > Persons > Igor Machado Coelho

Publications

2023
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/ol/MarquesCCOMMC23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/MarquesCCOMMC23
Elias L. Marques, Vitor Nazário Coelho, Igor Machado Coelho, Luiz Satoru Ochi, Nelson Maculan, Nenad Mladenovic, Bruno N. Coelho:
A two-phase multi-objective metaheuristic for a green UAV grid routing problem. Optim. Lett. 17(9): 2233-2256 (2023)
2022
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/rairo/MarquesCCFKOC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/MarquesCCFKOC22
Elias L. Marques, Vitor Nazário Coelho, Igor Machado Coelho, Yuri Abitbol de Menezes Frota, Roozbeh Haghnazar Koochaksaraei, Luiz Satoru Ochi, Bruno N. Coelho:
UAVs routes optimization on smart cities and regions. RAIRO Oper. Res. 56(2): 853-869 (2022)
2019
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/icvns/MarquesCCCO19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icvns/MarquesCCCO19
Elias L. Marques, Vitor Nazário Coelho, Igor Machado Coelho, Bruno N. Coelho, Luiz S. Ochi:
A Multi-objective Metaheuristic for a Green UAV Grid Routing Problem. ICVNS 2019: 152-166

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.