default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatheus Nohra Haddad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Matheus Nohra Haddad
, Andréa Cynthia Santos, Christophe Duhamel, Amadeu Almeida Coco:
Intelligent Drone Swarms to Search for Victims in Post-Disaster Areas. Sensors 23(23): 9540 (2023)
2010 – 2019
- 2018
- [j3]Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Simone L. Martins, Luiz Satoru Ochi, Marcone Jamilson Freitas Souza, Richard F. Hartl:
Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur. J. Oper. Res. 270(3): 1014-1027 (2018) - [i1]Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Luiz Satoru Ochi, Simone L. Martins, Marcone Jamilson Freitas Souza, Richard F. Hartl:
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads. CoRR abs/1802.06318 (2018) - 2016
- [j2]Vitor Nazário Coelho, Igor Machado Coelho, Marcone J. F. Souza, Thays A. Oliveira, Luciano Perdigão Cota, Matheus Nohra Haddad, Nenad Mladenovic, Rodrigo César Pedrosa Silva, Frederico G. Guimarães:
Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems. Evol. Comput. 24(4): 637-666 (2016) - 2014
- [c4]Luciano Perdigão Cota, Matheus Nohra Haddad, Marcone Jamilson Freitas Souza, Vitor Nazário Coelho:
AIRP: A heuristic algorithm for solving the unrelated parallel machine scheduling problem. IEEE Congress on Evolutionary Computation 2014: 1855-1862 - [c3]Matheus Nohra Haddad, Luciano Perdigão Cota, Marcone J. F. Souza, Nelson Maculan:
Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search. ICEIS (Revised Selected Papers) 2014: 131-148 - [c2]Matheus Nohra Haddad, Luciano Perdigão Cota, Marcone Jamilson Freitas Souza, Nelson Maculan:
AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times. ICEIS (1) 2014: 376-383 - 2012
- [j1]Igor Machado Coelho, Pablo Luiz Araújo Munhoz, Matheus Nohra Haddad, Marcone Jamilson Freitas Souza, Luiz Satoru Ochi:
A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups. Electron. Notes Discret. Math. 39: 99-106 (2012) - [c1]Matheus Nohra Haddad, Igor Machado Coelho, Marcone Jamilson Freitas Souza, Luiz Satoru Ochi, Haroldo Gambini Santos, Alexandre Xavier Martins:
GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times. SCCC 2012: 152-160
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
