default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Eduardo de Andrade
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Mariana A. Londe
, Luciana S. Pessoa, Carlos Eduardo de Andrade, Mauricio G. C. Resende:
Biased random-key genetic algorithms: A review. Eur. J. Oper. Res. 321(1): 1-22 (2025)- 2024
- [j12]Carlos Eduardo de Andrade, Luciana S. Pessoa, Slawomir Stawiarski:
The Physical Cell Identity Assignment Problem: A Practical Optimization Approach. IEEE Trans. Evol. Comput. 28(2): 282-292 (2024) - 2023
- [i1]Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade, Mauricio G. C. Resende:
Biased Random-Key Genetic Algorithms: A Review. CoRR abs/2312.00961 (2023) - 2022
- [j11]Carlos Eduardo de Andrade, Simon D. Byers, Vijay Gopalakrishnan, Emir Halepovic, David J. Poole, Lien K. Tran, Christopher T. Volinsky:
Corrigendum to "Scheduling software updates for connected cars with limited availability" [Appl. Soft Comput. (2019) 105575]. Appl. Soft Comput. 114: 106523 (2022) - [j10]Mariana A. Londe, Carlos Eduardo de Andrade, Luciana S. Pessoa:
Exact and heuristic approaches for the root sequence index allocation problem. Appl. Soft Comput. 130: 109634 (2022) - [c7]Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade:
The P-Next Center Problem with Capacity and Coverage Radius Constraints: Model and Heuristics. MIC 2022: 335-349 - 2021
- [j9]Carlos Eduardo de Andrade, Rodrigo F. Toso, José Fernando Gonçalves, Mauricio G. C. Resende:
The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications. Eur. J. Oper. Res. 289(1): 17-30 (2021) - [j8]Mariana A. Londe, Carlos Eduardo de Andrade, Luciana S. Pessoa:
An evolutionary approach for the p-next center problem. Expert Syst. Appl. 175: 114728 (2021) - [c6]Carlos Eduardo de Andrade, Ajay Mahimkar, Rakesh K. Sinha, Weiyi Zhang, André Augusto Ciré, Giritharan Rana, Zihui Ge, Sarat C. Puthenpura, Jennifer Yates, Robert Riding:
Minimizing Effort and Risk with Network Change Deployment Planning. Networking 2021: 1-9 - [c5]Ajay Mahimkar, Carlos Eduardo de Andrade, Rakesh K. Sinha, Giritharan Rana:
A composition framework for change management. SIGCOMM 2021: 788-806
2010 – 2019
- 2019
- [j7]Carlos Eduardo de Andrade, Simon D. Byers, Vijay Gopalakrishnan, Emir Halepovic, David J. Poole, Lien K. Tran, Christopher T. Volinsky:
Scheduling software updates for connected cars with limited availability. Appl. Soft Comput. 82 (2019) - [j6]Carlos Eduardo de Andrade, Thuener Silva, Luciana S. Pessoa:
Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm. Expert Syst. Appl. 128: 67-80 (2019) - 2018
- [j5]Luciana S. Pessoa, Carlos Eduardo de Andrade:
Heuristics for a flowshop scheduling problem with stepwise job objective function. Eur. J. Oper. Res. 266(3): 950-962 (2018) - 2017
- [j4]Carlos Eduardo de Andrade, Shabbir Ahmed, George L. Nemhauser, Yufen Shao:
A hybrid primal heuristic for finding feasible solutions to mixed integer programs. Eur. J. Oper. Res. 263(1): 62-71 (2017) - [c4]Carlos Eduardo de Andrade, Simon D. Byers, Vijay Gopalakrishnan, Emir Halepovic, David J. Poole, Lien K. Tran, Christopher T. Volinsky:
Connected cars in cellular network: a measurement study. Internet Measurement Conference 2017: 235-241 - [c3]Carlos Eduardo de Andrade, Simon D. Byers, Vijay Gopalakrishnan, Emir Halepovic, Milap Majmundar, David J. Poole, Lien K. Tran, Christopher T. Volinsky:
Managing Massive Firmware-Over-The-Air Updates for Connected Cars in Cellular Networks. CarSys@MobiCom 2017: 65-72 - 2016
- [j3]Mauro Cardoso Lopes, Carlos Eduardo de Andrade, Thiago Alves de Queiroz, Mauricio G. C. Resende, Flávio Keidi Miyazawa:
Heuristics for a hub location-routing problem. Networks 68(1): 54-90 (2016) - 2015
- [b1]Carlos Eduardo de Andrade:
Algoritmos evolutivos para alguns problemas em telecomunicações. University of Campinas, Brazil, 2015 - [j2]Carlos Eduardo de Andrade, Mauricio G. C. Resende, Weiyi Zhang, Rakesh K. Sinha, Kenneth C. Reichmann, Robert D. Doverspike, Flávio Keidi Miyazawa:
A biased random-key genetic algorithm for wireless backhaul network design. Appl. Soft Comput. 33: 150-169 (2015) - [j1]Carlos Eduardo de Andrade, Rodrigo Franco Toso, Mauricio G. C. Resende, Flávio Keidi Miyazawa:
Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions. Evol. Comput. 23(2): 279-307 (2015) - 2014
- [c2]Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa:
Evolutionary algorithms for overlapping correlation clustering. GECCO 2014: 405-412 - 2013
- [c1]Carlos Eduardo de Andrade, Flávio Keidi Miyazawa, Mauricio G. C. Resende:
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. GECCO 2013: 463-470
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-12-26 01:54 CET 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:
